杭电ACm1014

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
using namespace std;    
int seed[100000];

int main(void)
{
    int step,mod;
    while( cin >> step >> mod)
    {
        seed[0]=0;
    int     res=1;
        for(int i=1;i<mod;i++)
        {    
            seed[i] =( seed[i-1] + step) % mod;
        }
            sort(seed,seed+mod);
        for(int i=0;i<mod;i++)
        {
            if(seed[i] != i)
                res =0;
        }
        if(res)
            cout<<setw(10)<<step<<setw(10)<<mod<<"    "<<"Good Choice"<<endl<< endl;
        else
            cout<<setw(10)<<step<<setw(10)<<mod<<"    "<<"Bad Choice"<<endl<<endl;
            //printf("%10d%10d    Bad Choice\n\n",step,mod);
    
    }
    return 0;
}

不知道为什么我用set容器库判断是否数组是否有重复元素老是wc