杭电oj1313（Round and Round We Go）

杭电oj1313

Problem Description

A cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a _{!0}cycle_{!1} of the digits of the original number. That is, if you consider the number after the last digit to _{!0}wrap around_{!1} 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

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