摸索C語言 前身 : 摸索C語言 http://mypaper.pchome.com.tw/iustlovefish 現在即將就讀中興大學資訊科學與工程學系 XD

79愛的鼓勵 1訂閱站台

作法 : GCD

/**********************************************************/

#include
#include
#include
long long int GCD(long long int a,long long int b)           
{           
  long long int temp;           
  while(a%b)                 
   {                 
     temp=a;                 
     a=b;                 
     b=temp%b;                            
   }
   return b;           
}
main()
{
 int n,time=0;
 char N[50];
 while(scanf("%d",&n)==1&&n!=-1)
     {
        scanf("%s",N);
        int M=strlen(N)-2,k=M-n,a;
        long long int s1=1,s2=1,cir=0,num=0,x,y;
        for(a=2;a           num=num*10+N[a]-48;
        for(a=M+2-n;a           cir=cir*10+N[a]-48;
        if(n!=0)
        {
           for(a=1;a<=k;a++)  s1=s1*10;
           for(a=1;a<=k+n;a++)  s2=s2*10;
            x=s2*num-s1*num+cir*s1;
            y=s2-s1;
            x=x/s2;
        }
        else
        {
           for(a=1;a<=M;a++)  s1=s1*10;
           x=num;
           y=s1;
        }
        long long int g=GCD (x,y);
        x=x/g;y=y/g;
        printf("Case %d: %lld/%lldn",++time,x,y);
     }
 return 0;
}
/*
Q332: Rational Numbers from Repeating Fractions
*/