Repeating Decimals,ACM/ICPC World Finals 1990,UVa202
2016-11-14 16:31
447 查看
#include<iostream> #include<string> using namespace std; int decimal[3000]; int r[3000]; int main(){ int a,b; int loop=0; int integer; cin>>a>>b; integer=a/b; r[0]=a-integer*b; if(r[0]){ for(int i=0;i<3000;i++){ r[i+1]=r[i]*10; if(r[i+1]>=b){ decimal[i]=r[i+1]/b; r[i+1]=r[i+1]-decimal[i]*b; } else decimal[i]=0; loop++; if(!r[i+1]||r[i+1]==r[0])break; } } cout<<integer<<".("; for(int i=0;i<loop;i++) cout<<decimal[i]; cout<<")"<<endl; cout<<"Loop is:"<<loop<<endl; }
相关文章推荐
- 循环小数(Repeating Decimals, ACM/ICPC World Finals 1990, UVa202)
- 习题3-8 循环小数(Repeating Decimals, ACM/ICPC World Finals 1990, UVa202)
- Repeating Decimals, ACM/ICPC World Finals 1990, UVa202
- ACM/ICPC World Finals 1990 && UVA 201 Squares(数正方形)
- 算法竞赛入门经典(第二版) 习题3-8 循环小数(Repeating Decimals) UVa202 Finals1990
- Sqaures, ACM/ICPC World Finals 1990, UVa
- [UVa 201]Squares 正方形,ACM/ICPC World Finals 1990
- 习题7-3 多米诺效应(The Domino Effect, ACM/ICPC World Finals 1991, UVa211)
- UVA 213 ACM-ICPC World Finals 1991 信息解码
- UVa202 ACM/ICPC 1990 循环小数
- 习题7-1 消防车(Firetruck, ACM/ICPC World Finals 1991, UVa208)
- ACM UVa 算法题 #202 - Repeating Decimals的解法
- Puzzle,ACM/ICPC World Finals 1993,UVa227
- UVA 1025 A Spy in the Metro - ACM/ICPC World Finals 2003
- 例题6-19 自组合(Self-Assembly, ACM/ICPC World Finals 2013, UVa 1572)
- Abbott的复仇(Abbott's Revenge, ACM/ICPC World Finals 2000, UVa 816)<经典BFS>
- Crossword Answers, ACM/ICPC World Finals 1994, UVa232
- 习题7-2 黄金图形(Golygons, ACM/ICPC World Finals 1993, UVa225)
- [UVa 213]Message Decoding,ACM/ICPC World Finals 1991 信息解码
- 信息解码(Message Decoding, ACM/ICPC World Finals 1991, UVa 213)