UVa 202 Repeating Decimals【模拟】

 1 #include<iostream>  
 2 #include<cstdio>  
 3 #include<cstring> 
 4 #include <cmath> 
 5 #include<stack>
 6 #include<vector>
 7 #include<map> 
 8 #include<set>
 9 #include<queue> 
10 #include<algorithm>  
11 using namespace std;
12 
13 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
14 
15 typedef long long LL;
16 const int INF = (1<<30)-1;
17 const int mod=1000000007;
18 const int maxn=100005;
19 
20 int vis[maxn],r[maxn],s[maxn];
21 
22 int main(){
23     int n,m;
24     while(cin>>n>>m){
25         memset(vis,0,sizeof(vis));
26         memset(r,0,sizeof(r));
27         memset(s,0,sizeof(s));
28         
29         int cnt=0;
30         int t=n;
31         r[cnt++]=n/m;
32         n=n%m;
33         while(!vis[n]&&n){
34             vis[n]=cnt;
35             s[cnt]=n;//s数组存的是对应的余数 
36             r[cnt++]=n*10/m;//r数组存的是对应的商 
37             n=n*10%m;
38         }
39         
40         printf("%d/%d = %d.",t,m,r[0]);
41         
42         for(int i=1;i<cnt&i<=50;i++){
43             if(s[i]==n&&n) printf("(");
44             printf("%d",r[i]);
45         }
46         if (!n) printf("(0");  
47         if (cnt > 50) printf("...");  
48         printf(")\n");  
49         printf("   %d = number of digits in repeating cycle\n\n",!n?1:cnt-vis[n]);  
50     }
51     return 0;
52 }