UVa 332 - Rational Numbers from Repeating Fractions
来源:互联网 发布:淘宝输入口令抢流量 编辑:程序博客网 时间:2024/05/26 12:59
題目:已知一個分數的小數形式和循環節長度,求分數。
分析:數論。利用題目給的公式直接求解即可。
處理過程中直接使用整數計算
然後對分子分母計算約分即可。
說明:發現並沒有讀過多少書╮(╯▽╰)╭。
#include <cstdio>int gcd(int a, int b){return a%b?gcd(b, a%b):b;}int main(){int n, cases = 1;char buf[1001]; while (~scanf("%d",&n) && n != -1) {scanf("%s",buf);int den = 1, num = 0;for (int i = 2; buf[i]; ++ i) {den *= 10;num = num *10 + (buf[i]-'0')*1;}if (n) {int temp = 1;for (int i = 0; i < n; ++ i)temp = temp*10;num = num-num/temp;den = den-den/temp;}int red = gcd(num, den);printf("Case %d: %d/%d\n",cases ++,num/red,den/red);}return 0;}
0 0
- UVa 332 - Rational Numbers from Repeating Fractions
- UVA, 332 Rational Numbers from Repeating Fractions
- UVa 10814 - Simplifying Fractions
- UVA 10976 - Fractions Again?!
- UVA 10976 - Fractions Again?!
- uva 834 - Continued Fractions
- UVa 834 - Continued Fractions
- UVA-10976 - Fractions Again?!
- UVA - 10976 Fractions Again?!
- UVa 10976 - Fractions Again?!
- UVa 10976 - Fractions Again?!
- UVa 10976 - Fractions Again?!
- UVA - 10976 Fractions Again?!
- uva 10976 - Fractions Again?!
- UVa 880 - Cantor Fractions
- UVa 10976 Fractions Again?!
- UVa 275 - Expanding Fractions
- Uva - 10976 - Fractions Again?!
- Android打开文件代码
- if---else---if分支的执行次序。
- Java 中The literal 078 of type int is out of range问题
- 在 Ubuntu 14.04/15.04 上配置 Node JS v4.0.0
- mogodb 复制集加分片环境搭建
- UVa 332 - Rational Numbers from Repeating Fractions
- vi tag标签 方便查看代码
- C#-队列
- Eclipse中dynamic web project与web project 的区别
- 如何编译文件(gcc + nasm)
- 数组和指针
- DSP学习初阶的一些笔记
- PostgreSQL的hstore初步学习
- xcode7 ios9遇到的几个坑