学步园

暴力 枚举。。。。。

code

/*
ID: yueqiq
LANG: C++
TASK: runround
*/
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define ls rt<<1
#define rs rt<<1|1
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("runround.in","r",stdin)
#define writef freopen("runround.out","w",stdout)
const double pi = acos(-1.0);
const int maxn = 50;
const int BigP = 99999999;
const int INF = 99999999;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
using namespace std;
int q[10],vis1[10],vis2[10];
bool check(int key){
    SET(vis1,0);SET(vis2,0);
    int len=(int)log10(key),tmp,tlen;
    tlen=len;
    while(key){
        tmp=key%10;
        q[tlen--]=tmp;
        key/=10;
    }
    //FOR(i,0,9) printf("%d ",q[i]);
    //LN;
    FOR(i,0,len) vis1[q[i]]++;
    FOR(i,0,9) if(vis1[i]>1) return false;
    //puts("??");
    int pos=0;
    FOR(i,0,len){
        int t=q[pos];
        vis2[t]++;
        if(vis2[t]>1) return false;
        pos=(pos+t)%(len+1);
    }
    if(pos!=0) return false;
    return true;
}
int main (){
    readf;
    writef;
    int N;
    SD(N);
    //PD(check(147));
    while(true){
        N++;
        //PD(check(N));

        if(check(N)){
            PD(N);LN;
            break;
        }
    }
	return 0;
}