POJ 1102 LC-Display 模拟
2014-07-28 16:07
288 查看
Description
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
Sample Output
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> #include<cstring> using namespace std; int main() { char e[20][3]= {" -","-"}; char q[33]; char w[1][2]= {"|"}; int m; int i,j,k; int t=0; while(scanf("%d%s",&m,q)!=EOF) { if(m==0) continue; if(t!=0) cout<<endl; t++; if(m==0&&q[0]=='0') break; for(i=0; i<=strlen(q)-1; i++) { if(i!=0) cout<<' '; if(q[i]=='1'||q[i]=='4') { for(j=1; j<=m+2; j++) cout<<' '; } else { cout<<' '; for(j=1; j<=m; j++) { cout<<e[1]; } cout<<' '; } } cout<<endl; for(i=1; i<=m; i++) { for(k=0; k<=strlen(q)-1; k++) { if(k!=0) cout<<' '; if(q[k]=='5'||q[k]=='6') { cout<<w[0]; for(j=0; j<=m; j++) cout<<' '; } else if(q[k]=='1'||q[k]=='2'||q[k]=='3'||q[k]=='7') { for(j=0; j<=m; j++) cout<<' '; cout<<w[0]; } else { cout<<w[0]; for(j=0; j<m; j++) cout<<' '; cout<<w[0]; } } cout<<endl; } for(i=0; i<strlen(q); i++) { if(i!=0) cout<<' '; if(q[i]=='1'||q[i]=='7'||q[i]=='0') { for(j=1; j<=m+2; j++) cout<<' '; } else { cout<<' '; for(j=1; j<=m; j++) { cout<<e[1]; } cout<<' '; } } cout<<endl; for(i=1; i<=m; i++) { for(k=0; k<=strlen(q)-1; k++) { if(k!=0) cout<<' '; if(q[k]=='2') { cout<<w[0]; for(j=0; j<=m; j++) cout<<' '; } else if(q[k]=='0'||q[k]=='8'||q[k]=='6') { cout<<w[0]; for(j=0; j<m; j++) cout<<' '; cout<<w[0]; } else { for(j=0; j<=m; j++) cout<<' '; cout<<w[0]; } } cout<<endl; } for(i=0; i<strlen(q); i++) { if(i!=0) cout<<' '; if(q[i]=='1'||q[i]=='7'||q[i]=='4') { for(j=1; j<=m+2; j++) cout<<' '; } else { cout<<' '; for(j=1; j<=m; j++) { cout<<e[1]; } cout<<' '; } } cout<<endl; } return 0; }
把没组数字分为五段 (三横二竖) 其实写出前两段 后三段也差不多了。。。
这次终于把速度提高了一点= =
显示出来的数字还挺 好看的 哈
相关文章推荐
- poj 1102 LC-Display
- poj_1102_LC-Display(数段码模拟)
- poj 1102 LC—display
- poj1102 LC-Display
- POJ 1102 - LC-Display
- poj1102——LC-Display
- POJ 1102 LC Display G++
- POJ 1102 LC-Display(模拟题)
- POJ_1102_LC-Display
- poj1102 LC-Display
- poj 1102 LC-Display(模拟)
- POJ 1102 LC-Display
- UVALive5642 UVA706 HDU1332 POJ1102 LC-Display【打印图案】
- poj 1102 LC-Display显示器
- poj 1102 LC-Display
- OpenJudge / Poj 1102 LC-Display C++
- POJ 1102
- POJ 2421 HDOJ 1102 Constructing Roads(kuangbin带你飞 专题六:最小生成树)
- 最小生成树MST : poj 1258 Agri-Net+hdu 1102 Constructing Roads
- poj1102+每个数字有七笔画每行扫描+注意细节每个样例后要有两个回车