题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=103453#problem/F
题目大意:给一个分数,化为循环小数
题目分析:数学题,利用十进制展开,分子分母与10互质则小数点后一位开始循环。若不互质,统计约数2,5的个数较大的为n,则从n+1开始循环。(用数学方法可以易证)
另用抽屉原理可得循环节必小于分母,又数据均<3000,暴力也可求解。
注意要点:1.首先先要约分 2.格式很坑,最后一组数据结束后还需空一行
AC代码:
#include<stdio.h>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
int gcd(int x,int y){
return x==0 ? y : gcd(y%x,x);
}
int main()
{
int T={0},p,q;
string s1[100],s2;
while(cin >> p >> q)
{
int x1={0},x2={0},x,m,n={0},ans={0};
cout << p << "/" << q << " = " << p/q << ".";
x=gcd(p,q); p=p/x; q=q/x; n=q;
while (n%2==0){
n=n/2;
x1++;
}
while (n%5==0){
n=n/5;
x2++;
}
x=max(x1,x2); n=(p%q)*10;
for (int i=1;i<=x;i++){
cout << n/q;
n=(n%q)*10;
}
cout << "(" << n/q;
p=n; ans=1; n=(n%q)*10;
while (n!=p){
ans++; if (ans<=50) cout << n/q;
n=(n%q)*10;
}
if (ans>50) cout << "...";
cout << ")" << endl << " " << ans
<< " = number of digits in repeating cycle" << endl << endl;
}
}