POJ1047解题报告

题目如下：

Round and Round We Go

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 8338		Accepted: 3770

Description

A cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a"cycle"of the digits of the original number. That is, if you consider the number after the last digit to "wrap around"back to the first digit, the sequence of digits in both numbers will be the same, though they may start at different positions.For example, the number 142857 is cyclic, as illustrated by the following table:
142857 *1 = 142857
142857 *2 = 285714
142857 *3 = 428571
142857 *4 = 571428
142857 *5 = 714285
142857 *6 = 857142

Input

Write a program which will determine whether or not numbers are cyclic. The input file is a list of integers from 2 to 60 digits in length. (Note that preceding zeros should not be removed, they are considered part of the number and count in determining n. Thus, "01"is a two-digit number, distinct from "1" which is a one-digit number.)

Output

For each input integer, write a line in the output indicating whether or not it is cyclic.

Sample Input

142857
142856
142858
01
0588235294117647

Sample Output

142857 is cyclic
142856 is not cyclic
142858 is not cyclic
01 is not cyclic
0588235294117647 is cyclic
主要考察的知识点就是大整数的乘法。我这一篇是前面一篇《判断一个数是否是循环数的算法》的后续，当时写那篇文章时对于大整数问题还不是很熟，所以

没办法解决数的溢出的问题。现在了解到，大整数的解决办法就是利用数组。只要知道了这个思想，就好办了。写代码细心一点，就能够AC。

代码如下：

#include<stdio.h>
int num[60];
int result[60];
/*
**author:tammypi
**function：judge a number whether a cyclic number
**date: 2010.11.29 16:12
*/
//reset,make the elements of the matrix become -1
void reset(int *a)
{
     int i;
     for(i=0;i<60;i++)
     {
                      a[i]=-1;
     }
}
int getInt(char c)
{
    int i=-1;
    switch(c)
    {
             case '0':i=0;break;
             case '1':i=1;break;
             case '2':i=2;break;
             case '3':i=3;break;
             case '4':i=4;break;
             case '5':i=5;break;
             case '6':i=6;break;
             case '7':i=7;break;
             case '8':i=8;break;
             case '9':i=9;break; 
    }
    return i;
}
//judge,if the number is cyclic,return zero;else return one
int judge(char *s)
{
    int length=strlen(s);
    reset(num);
    //shift char[] to int[]
    int i;
    for(i=0;i<length;i++)
    {
           num[60-length+i]=getInt(s[i]);
    }
    //multiply and judge
    for(i=1;i<=length;i++)
    {
            reset(result);
            //multiply
            int j;
            int jinwei;
            for(j=0;j<length;j++)
            {
                                 result[60-length+j]=0;
            }
            for(j=0;j<length;j++)
            {
                                 int temp;
                                 if(j==0)
                                 {
                                         temp=num[60-1-j]*i;
                                         if(temp>=10)
                                         {
                                                     result[60-1-j]=temp%10;
                                                     jinwei=temp/10;
                                         }
                                         else
                                         {
                                                      result[60-1-j]=temp;
                                                      jinwei=0;
                                         }
                                 }
                                 else
                                 {
                                          temp=num[60-1-j]*i+jinwei;
                                          if(temp>=10)
                                          {
                                                      result[60-1-j]=temp%10;
                                                      jinwei=temp/10;
                                          }
                                          else
                                          {
                                                       result[60-1-j]=temp;
                                                       jinwei=0;
                                          }
                                 }
            }
            int order[60];
            int top=-1;
            for(j=0;j<length;j++)
            {
                                 if(num[60-length]==result[60-length+j])
                                 {
                                                                        order[++top]=60-length+j;
                                 }
            }
            if(top==-1)
            {
                       return 1;
            }
            int tag3=1;
            //judge
            for(j=0;(j<=top)&&(tag3==1);j++)
            {
                               int state=order[j];
                               int k;
                               int tag1=1;
                               int tag2=1;
                               for(k=order[j];(k<60)&&(tag1==1);k++)
                               {
                                                         if(num[60-length+k-order[j]]!=result[k])
                                                         {
                                                                                                 tag1=0;
                                                                                                 if(j==top)
                                                                                                 {
                                                                                                           return 1;
                                                                                                 }
                                                                                                 continue;
                                                         }
                               }
                               for(k=60-length;(k<order[j])&&(tag1==1)&&(tag2==1);k++)
                               {
                                                         if(num[60-length+(60-order[j])+(k-60+length)]!=result[k])
                                                         {
                                                                                                 tag2=0;
                                                                                                 if(j==top)
                                                                                                 {
                                                                                                           return 1;
                                                                                                 }
                                                                                                 continue;
                                                         }
                               }
                               if((tag1==1)&&(tag2==1))
                               {
                                                       tag3=0;
                                                       continue;
                               }
            }
    }
    return 0;
}
int main()
{
    char s[60];
    while(scanf("%s",s)!=EOF)
    {
            if(judge(s)==0)
            {
                           printf("%s is cyclic/n",s);
            }
            else
            {
                           printf("%s is not cyclic/n",s);
            }
    }
    return 0;
}