POJ 1047 没什么难度，注意读懂题。

#include<iostream>
#include<string>
using namespace std;

bool add(string &s,string temp)
{
 int carry = 0;
 for(int i=s.size()-1;i>=0;i--){
  int a = s[i] -'0' + temp[i] -'0' + carry;
  s[i] = a%10+'0';
  carry = a/10;
 }
 if(carry)return false;
 else return true;
}
void cycle(string &r)
{
 char temp = r[r.size()-1];
 for(int i=r.size()-1;i>=1;i--)
  r[i] = r[i-1];
 r[0] = temp;
}
bool judge(string s)
{
 string r = s;
 string temp = s;
 
 for(int i=0;i<s.size()-1;i++){
  if(!add(s,temp))return false;
  int j;
  r = s;
  for(j=0;j<r.size();j++){
   if(r==temp)break;
   cycle(r);
  }
  if(j==r.size())return false;
 }
 return true;
}
   
int main()
{
 string s;
 while(cin>>s){
  if(judge(s))
   cout<<s<<" is cyclic"<<endl;
  else cout<<s<<" is not cyclic"<<endl;
 }
 return 0;
}