Codeforces 363A Soroban(算盘模拟)
2014-10-20 16:39
330 查看
#include <iostream> #include <cstdio> using namespace std; void print(int t) { if (t / 5 == 0) { printf("o-|"); for (int i = 0; i < t; i++) printf("o"); printf("-"); for (int i = t+1; i < 5;i++) printf("o"); printf("\n"); } else { printf("-o|"); int x = t - 5 ; for (int i = 0; i < x; i++) printf("o"); printf("-"); for (int i = x+1; i < 5;i++) printf("o") ; printf("\n"); } } int main() { int n; int t; while (scanf("%d",&n) != EOF) { if (n==0) printf("o-|-oooo\n"); while (n) { t = n % 10; print(t); n = n / 10; } }
}
</pre><pre code_snippet_id="489924" snippet_file_name="blog_20141020_1_3257731" name="code" class="cpp"><pre name="code" class="cpp">#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
int main()
{
string s;
while(cin>>s)
{
for(int i=s.size();i>=0;i--)
{
if(s[i]=='0')
cout<<"O-|-OOOO"<<endl;
else if(s[i]=='1')
cout<<"O-|O-OOO"<<endl;
else if(s[i]=='2')
cout<<"O-|OO-OO"<<endl;
else if(s[i]=='3')
cout<<"O-|OOO-O"<<endl;
else if(s[i]=='4')
cout<<"O-|OOOO-"<<endl;
else if(s[i]=='5')
cout<<"-O|-OOOO"<<endl;
else if(s[i]=='6')
cout<<"-O|O-OOO"<<endl;
else if(s[i]=='7')
cout<<"-O|OO-OO"<<endl;
else if(s[i]=='8')
cout<<"-O|OOO-O"<<endl;
else if(s[i]=='9')
cout<<"-O|OOOO-"<<endl;
}}return 0;
}
相关文章推荐
- Codeforces 363A Soroban(算盘模拟)
- Codeforces 363A Soroban-算盘模拟
- CodeForces 731B-Coupons and Discounts(贪心 模拟)
- CodeForces 777C Alyona and Spreadsheet【一维数组模拟二维】
- codeforces 931A - Friends Meeting 模拟
- 【CodeForces】702D - Road to Post Office 模拟,初中数学题
- CodeForces 260A Adding Digits 模拟
- Codeforces 659B Qualifying Contest 【模拟】
- CodeForces 676 B. Pyramid of Glasses(模拟)
- CodeForces 339B Xenia and Ringroad(水题模拟)
- Codeforces 230C Shifts(模拟+展开字符串)
- CodeForces 4B Before an Exam(数学+模拟)
- 【模拟】【codeforces】451B Sort the Array
- 【打CF,学算法——二星级】CodeForces 292A SMSC (模拟)
- CodeForces - 940B(模拟)
- Codeforces 716B Complete the Word【模拟】 (Codeforces Round #372 (Div. 2))
- CodeForces 154B——Colliders——筛选素数,模拟标记
- Codeforces 689A. Mike and Cellphone(模拟)
- Codeforces 691C. Exponential notation(模拟)
- Codeforces 509C. Sums of Digits 贪心 + 模拟