joj1025

本博客介绍如何使用编程技巧模拟LC显示屏显示数字。详细解释了输入处理、数字显示风格设定以及输出格式化,包括空白填充和间距处理。

 

1025: LC-Display

ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE
3s8192K2238631Standard
A friend of you has just bought a new computer. Until now, the most powerful computer he ever used has been a pocket calculator. Now, looking at his new computer, he is a bit disappointed, because he liked the LC-display of his calculator so much. So you decide to write a program that displays numbers in an LC-display-like style on his computer.


Input

The input contains several lines, one for each number to be displayed. Each line contains two integers s, n (1 <= s <= 10, 0 <= n <= 99 999 999), where n is the number to be displayed and s is the size in which it shall be displayed.

The input file will be terminated by a line containing two zeros. This line should not be processed.


Output

Output the numbers given in the input file in an LC-display-style using s ``-'' signs for the horizontal segments and s ``|'' signs for the vertical ones. Each digit occupies exactly s+2 columns and 2s+3 rows. (Be sure to fill all the white space occupied by the digits with blanks, also for the last digit.) There has to be exactly one column of blanks between two digits.

Output a blank line after each number. (You will find a sample of each digit in the sample output.)


Sample Input

2 12345
3 67890
0 0

Sample Output

      --   --        -- 
   |    |    | |  | |   
   |    |    | |  | |   
      --   --   --   -- 
   | |       |    |    |
   | |       |    |    |
      --   --        -- 

 ---   ---   ---   ---   --- 
|         | |   | |   | |   |
|         | |   | |   | |   |
|         | |   | |   | |   |
 ---         ---   ---       
|   |     | |   |     | |   |
|   |     | |   |     | |   |
|   |     | |   |     | |   |
 ---         ---   ---   --- 


 

 

 

#include <iostream>
#include <cstdio>
using namespace std;

void out(int s,char p[])
{
 for(int i=0;p[i]!='\0';i++)//最顶端
 {
  if(i!=0)cout<<" ";
  switch(p[i])
  {
   case '1':
   case '4':
     for(int j=1;j<=s+2;j++)
         cout<<" ";
         break;
   case '2':
   case '3':
   case '5':
   case '6':
   case '7':
   case '8':
   case '9':
   case '0':
     cout<<" ";
         for(int j=1;j<=s;j++)
         cout<<"-";
         cout<<" ";
         break;
  }
 }
 cout<<endl;
 for(int i=1;i<=s;i++)//第二部分
 {
  for(int j=0;p[j]!='\0';j++)
  {
   if(j!=0)cout<<" ";
   switch(p[j])
   {
    case '0':
    case '4':
    case '8':
    case '9':
      cout<<"|";
      for(int t=1;t<=s;t++)
      cout<<" ";
      cout<<"|";
      break;
    case '1':
    case '2':
    case '3':
    case '7':
      for(int t=0;t<=s;t++)
      cout<<" ";
      cout<<"|";
      break;
    case '5':
    case '6':
      cout<<"|";
      for(int t=0;t<=s;t++)
      cout<<" ";
      break;
   }
  }
  cout<<endl;
 }

 for(int i=0;p[i]!='\0';i++)//第三部分
 {
  if(i!=0)cout<<" ";
  switch(p[i])
  {
   case '0':
   case '1':
   case '7':
     for(int t=1;t<=s+2;t++)
     cout<<" ";
     break;
   default :
     cout<<" ";
     for(int t=1;t<=s;t++)
     cout<<"-";
     cout<<" ";
     break;
  }
 }
 cout<<endl;
 for(int i=1;i<=s;i++)//第四部分
 {
  for(int j=0;p[j]!='\0';j++)
  {
   if(j!=0)cout<<" ";
   switch(p[j])
   {
    case '1':
    case '3':
    case '4':
    case '5':
    case '7':
    case '9':
      for(int t=0;t<=s;t++)
      cout<<" ";
      cout<<"|";
      break;
    case '2':
      cout<<"|";
      for(int t=1;t<=s+1;t++)
      cout<<" ";
      break;
    default :
      cout<<"|";
      for(int t=1;t<=s;t++)
      cout<<" ";
      cout<<"|";
      break;
   }
  }
  cout<<endl;
 }
 for(int i=0;p[i]!='\0';i++)
 {
  if(i!=0)cout<<" ";
  switch(p[i])
  {
   case '1':
   case '4':
   case '7':
     for(int t=1;t<=s+2;t++)
     cout<<" ";
     break;
   default :
     cout<<" ";
     for(int t=1;t<=s;t++)
     cout<<"-";
     cout<<" ";
     break;
  }
 }
 cout<<endl;
}


int main()
{
 freopen("in.txt","r",stdin);
 freopen("out.txt","w",stdout);
 int n;
 char p[10];
 bool temp=false;
 while(scanf("%d%s",&n,p)==2)
 {
  //cout<<n<<" "<<p<<endl;
  if(temp)cout<<endl;
  temp=true;
  if(n==0&&p[0]=='0')break;
  out(n,p);
 }
 return 0;
}

计及风电并网运行的微电网及集群电动汽车综合需求侧响应的优化调度策略研究(Matlab代码实现)内容概要:本文研究了计及风电并网运行的微电网及集群电动汽车综合需求侧响应的优化调度策略,并提供了基于Matlab的代码实现。研究聚焦于在高渗透率可再生能源接入背景下,如何协调微电网内部分布式电源、储能系统与大规模电动汽车充电负荷之间的互动关系,通过引入需求侧响应机制,建立多目标优化调度模型,实现系统运行成本最小化、可再生能源消纳最大化以及电网负荷曲线的削峰填谷。文中详细阐述了风电出力不确定性处理、电动汽车集群充放电行为建模、电价型与激励型需求响应机制设计以及优化求解算法的应用。; 适合人群:具备一定电力系统基础知识和Matlab编程能力的研究生、科研人员及从事新能源、微电网、电动汽车等领域技术研发的工程师。; 使用场景及目标:①用于复现相关硕士论文研究成果,深入理解含高比例风电的微电网优化调度建模方法;②为开展电动汽车参与电网互动(V2G)、需求侧响应等课题提供仿真平台和技术参考;③适用于电力系统优化、能源互联网、综合能源系统等相关领域的教学与科研项目开发。; 阅读建议:建议读者结合文中提供的Matlab代码进行实践操作,重点关注模型构建逻辑与算法实现细节,同时可参考文档中提及的其他相关案例(如储能优化、负荷预测等),以拓宽研究视野并促进交叉创新。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值