A.Soroban
来源:互联网 发布:电脑加密软件下载 编辑:程序博客网 时间:2024/05/16 23:44
You know that Japan is the country with almost the largest 'electronic devices per person' ratio. So you might be quite surprised to find out that the primary school in Japan teaches to count using aSoroban — an abacus developed in Japan. This phenomenon has its reasons, of course, but we are not going to speak about them. Let's have a look at the Soroban's construction.
Soroban consists of some number of rods, each rod contains five beads. We will assume that the rods are horizontal lines. One bead on each rod (the leftmost one) is divided from the others by a bar (the reckoning bar). This single bead is calledgo-dama and four others are ichi-damas. Each rod is responsible for representing a single digit from 0 to 9. We can obtain the value of a digit by following simple algorithm:
- Set the value of a digit equal to 0.
- If the go-dama is shifted to the right, add 5.
- Add the number of ichi-damas shifted to the left.
Thus, the upper rod on the picture shows digit 0, the middle one shows digit 2 and the lower one shows 7. We will consider the top rod to represent the last decimal digit of a number, so the picture shows number 720.
Write the program that prints the way Soroban shows the given number n.
The first line contains a single integer n (0 ≤ n < 109).
Print the description of the decimal digits of number nfrom the last one to the first one (as mentioned on the picture in the statement), one per line. Print the beads as large English letters 'O', rod pieces as character '-' and the reckoning bar as '|'. Print as many rods, as many digits are in the decimal representation of number n without leading zeroes. We can assume that number 0 has no leading zeroes.
2
O-|OO-OO
13
O-|OOO-OO-|O-OOO
720
O-|-OOOOO-|OO-OO-O|OO-OOAC code:
#include <iostream>#include <string>using namespace std;int main(){int n,m,i,j;while(cin>>n){if(n==0)cout<<"O-|-OOOO"<<endl;else{while(n){m=n%10;n=n/10;if(m==0){cout<<"O-|-OOOO"<<endl;}else if(m<=4){cout<<"O-|";if(m==4){cout<<"OOOO-"<<endl;}else{for( i=1;i<=m;i++)cout<<"O";cout<<"-";for( j=m+1;j<=4;j++)cout<<"O";cout<<endl;}} else if(m>=5){cout<<"-O|";if(m-5==4){cout<<"OOOO-"<<endl;}else {for( i=1;i<=m-5;i++)cout<<"O";cout<<"-";for( j=m-4;j<=4;j++)cout<<"O";cout<<endl;}}}}}return 0;}
- A.Soroban
- A. Soroban
- codeforces-363A. Soroban
- Codeforces 363A Soroban
- CodeForces 363A - Soroban
- A. Soroban----水题
- codeforces 363A round211 div2 A.Soroban
- Codeforces #211 (Div. 2) A. Soroban
- Codeforces 363A Soroban(算盘模拟)
- Codeforces 363A Soroban(算盘模拟)
- Codeforces 363A Soroban-算盘模拟
- Codeforces #211 (Div. 2) A. Soroban
- Codeforces Round #211 (Div. 2), problem: (A) Soroban,problem: (B) Fence,problem: (C)
- a
- a
- a
- a
- a
- 保时捷917/7代911实拍回顾
- 怎么编译apue的程序
- 线程的生命周期
- hdu4770Lights Against Dudely
- 13个mysql数据库的实用SQL小技巧
- A.Soroban
- (关联容器)set 和 multiset
- 远程桌面连接数超过最大限制解决方法
- ORACLE varchar2 长度问题整体
- Oracle通过myebatis批量添加数据
- easyUI datagrid避免二次渲染
- matlab中发生Undefined function 'regessionLoop' for input arguments of type 'char'.
- ZOJ 3717 - Balloon 简单二分+2-sat..精度恶心..
- c++中的数据类型