USACO Section 2.2: Runaround Numbers

简单题

 /*
 ID: yingzho1
 LANG: C++
 TASK: runround
 */
 #include <iostream>
 #include <fstream>
 #include <string>
 #include <map>
 #include <vector>
 #include <set>
 #include <algorithm>
 #include <stdio.h>
 #include <queue>
 #include <cstring>

 using namespace std;

 ifstream fin("runround.in");
 ofstream fout("runround.out");

 int N;

 int weishu(int n) {
     ;
     while (n) {
         n /= ;
         ret++;
     }
     return ret;
 }

 bool isRunAround(int n) {
     int acount = weishu(n);
     vector<bool> visit(acount);
     string s;
     while (n) {
          == ) return false;
         s += ;
         n /= ;
     }
     reverse(s.begin(), s.end());
     ;
     int len = s.size();
     ; i < acount; i++) {
         cur = (cur + ')) % len;
         if (visit[cur]) return false;
         visit[cur] = true;
     }
     return true;
 }

 bool isUnique(int n) {
     set<int> S;
     while (n) {
         )) return false;
         S.insert(n % );
         n /= ;
     }
     return true;
 }

 int main()
 {
     fin >> N;
     ;
     ) {
         if (isUnique(M) && isRunAround(M)) break;
         M++;
     }
     fout << M << endl;

     ;
 }