XTU1236:Fraction
来源:互联网 发布:淘宝模特兼职价格 编辑:程序博客网 时间:2024/06/14 21:17
Fraction
Problem Description:
Everyone has silly periods, especially for RenShengGe. It's a sunny day, no one knows what happened to RenShengGe, RenShengGe says that he wants to change all decimal fractions between 0 and 1 to fraction. In addtion, he says decimal fractions are too complicate, and set that is much more convient than 0.33333... as an example to support his theory.
So, RenShengGe lists a lot of numbers in textbooks and starts his great work. To his dissapoint, he soon realizes that the denominator of the fraction may be very big which kills the simplicity that support of his theory.
But RenShengGe is famous for his persistence, so he decided to sacrifice some accuracy of fractions. Ok, In his new solution, he confines the denominator in [1,1000] and figure out the least absolute different fractions with the decimal fraction under his restriction. If several fractions satifies the restriction, he chooses the smallest one with simplest formation.
Input
The first line contains a number T(no more than 10000) which represents the number of test cases.
And there followed T lines, each line contains a finite decimal fraction x that satisfies .
Output
For each test case, transform x in RenShengGe's rule.
Sample Input
3
0.9999999999999
0.3333333333333
0.2222222222222
Sample Output
1/1
1/3
2/9
tip
You can use double to save x;
题意:
给出一个小数,求出一个最接近这个小数的分数
思路:
枚举分母,然后通过相乘得到分子
#include <iostream>#include <stdio.h>#include <string.h>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <bitset>#include <algorithm>#include <climits>using namespace std;#define lson 2*i#define rson 2*i+1#define LS l,mid,lson#define RS mid+1,r,rson#define UP(i,x,y) for(i=x;i<=y;i++)#define DOWN(i,x,y) for(i=x;i>=y;i--)#define MEM(a,x) memset(a,x,sizeof(a))#define W(a) while(a)#define gcd(a,b) __gcd(a,b)#define LL long long#define N 1000005#define MOD 1000000007#define INF 0x3f3f3f3f#define EXP 1e-8#define lowbit(x) (x&-x)int t;double s;int main(){ int i,j; int a,b; double minn; scanf("%d",&t); while(t--) { scanf("%lf",&s); minn = fabs(0-s); a = 0,b=1; for(i = 1; i<=1000; i++) { j = (int)(i*s+0.5); if(j<=i) { double f = j*1.0/i; double p = fabs(f-s); if(minn>p) { minn = p; a = j; b = i; } } } int r = gcd(a,b); printf("%d/%d\n",a/r,b/r); } return 0;}
- XTU1236:Fraction
- XTU1236 Fraction
- Fraction
- Fraction
- POJ1930Dead Fraction
- proper fraction
- HDU5912-Fraction
- HDU5912 Fraction
- HDU5912-Fraction
- HDU5912 Fraction
- hdu5912 Fraction
- A. Fraction
- POJ 1930 Dead Fraction
- Continued Fraction of Squareroot
- POJ_1980_Unit Fraction Partition
- SZU:G32 Mass fraction
- POJ-1930-Dead Fraction
- An Irreducible Fraction
- vim快捷键,及vimrc的简单设置
- LDAP 中 CN, OU, DC 的含义
- 取消的排料導入
- Linux第二课 文件系统及常用命令
- 使用CNN(convolutional neural nets)检测脸部关键点教程(四):学习率,学习势,dropout
- XTU1236:Fraction
- JDBC中的装饰着模式
- Servlet开篇
- awk编程总结
- 二叉树建立出现的指针问题 转载~~~~~~~~
- Java多线程中的阻塞队列和并发集合
- uvalive 4394 string painter (序列dp)
- 【机房收费系统】MDI菜单显示子窗体
- C语言文件处理-对图片取模数据的转换