传送门:POJ1930
题意:给出一个无限不循环小数,但没说明是从哪一位开始循环的,将其转化为分母最小的最简分数。
思路:
据说是小学奥数知识:
推导过程:
图片转自:点击打开链接
具体实现过程就是循环节有多长就在分母上添几个9,非循环小数部分多长就在分母最后添几个0,分子按上面公式计算一下就行。
代码:
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pi acos(-1)
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define rep(i,x,n) for(int i=x;i<n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
using namespace std;
typedef pair<int,int>P;
const int MAXN=100010;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
ll toll(string &s)
{
return atoi(s.c_str());
}
int main()
{
string s;
ll u, v;
while(cin >> s, s != "0")
{
u = v = inf;
s.erase(0, 2);
while(s[s.size() - 1] == '.') s.erase(s.size() - 1);
for(int i = 0; i < s.size(); i++)
{
string r = s.substr(i, s.size() - i);
string l = s.substr(0, i);
ll fenmu = 0;
for(int j = 0; j < r.size(); j++)
fenmu = fenmu * 10 + 9;
if(fenmu == 0) fenmu = 1;
for(int j = 0; j < l.size(); j++)
fenmu = fenmu * 10;
ll fenzi = toll(s) - toll(l);
ll g = __gcd(fenzi, fenmu);
if(v > fenmu / g)
{
v = fenmu / g;
u = fenzi / g;
}
}
cout << u << '/' << v << endl;
}
return 0;
}