zoj 1073 Round and Round We Go

#include "iostream"#include "string"#include "algorithm"using namespace std;int main(int argc, char* argv[]){string str;while (cin >> str){string ss = str;int length = str.size();if (length == 1) break;int temp = 0, flag = 0;string s;for (int j = 1; j <= length; j++){   s = "";   str = ss;   for (int i = length - 1; i >= 0; i--)//大數相乘的做法！  {int ans = (str[i]-48) * j + temp;if (ans >= 10){temp = ans / 10;ans %= 10;}else{temp = 0;}if (i == 0 && temp != 0){s += (temp + 48);break;}s += (ans + 48);}  sort(str.begin(), str.end());//將兩個字串進行一個排序之後就容易比較出兩個字串是否相等了！  sort(s.begin(), s.end());  if (s != str)  {  flag = -1;  break;  }  else  continue;}if (flag == 0)cout << ss << " is cyclic" << endl;elsecout << ss << " is not cyclic" << endl;}return 0;}