Uva202 - Repeating Decimals
2014-08-02 16:20
330 查看
#include<stdio.h> #include<string.h> int fraction[4000]; int mod[4000]; int main(){ int a, b; int q,p,len; int d = 0; while (scanf("%d%d", &a, &b) != EOF){ mod[0] = a; fraction[0] = a / b; for (q = 1;; q++){ mod[q] = (mod[q - 1] - b*fraction[q - 1]) * 10; fraction[q] = mod[q] / b; for ( p = 1;p<q; p++){ if (mod[p] == mod[q]){ len = q - p; d = 1; break; } } if (d) break; } printf("%d/%d = %d.", a, b, fraction[0]); for (int i = 1; i < p; i++){ printf("%d", fraction[i]); } printf("("); for (int i = p; i < q; i++){ if (i >50){ printf("..."); break; } printf("%d", fraction[i]); } printf(")\n %d = number of digits in repeating cycle\n\n", len); d = 0; } return 0; }
相关文章推荐
- UVa 202, Repeating Decimals
- 循环小数(Repeating Decimals, ACM/ICPC World Finals 1990, UVa202)
- 3-8 uva 202 Repeating Decimals
- Uva 202 Repeating Decimals
- (Repeating Decimals) uva 202 需要一些灵感。。。
- UVA202 UVALive5141 Repeating Decimals
- [UVA 202]Repeating Decimals
- UVa202 Repeating Decimals
- 《算法竞赛入门经典2ndEdition 》习题3-8 循环小数(Repeating Decimals, Uva202)
- 【白书之路】UVa 202 Repeating Decimals 计算小数循环节
- UVa 202 - Repeating Decimals
- UVa202 Repeating Decimals
- UVA 202 Repeating Decimals
- Uva 202 Repeating Decimals
- 算法竞赛入门经典(第2版)习题3-8 循环小数 Repeating Decimals UVa202
- Repeating Decimals,ACM/ICPC World Finals 1990,UVa202
- UVa 202 - Repeating Decimals
- UVA202循环小数Repeating Decimals
- UVa 202 - Repeating Decimals
- uva_202_Repeating Decimals