nyoj-212 & whoj-1313

来源：互联网发布：windows xp sp3 纯净版编辑：程序博客网时间：2024/04/29 14:15

#include<iostream>#include<string.h>using namespace std;int a[1111],v[1111];int main(){int t;cin>>t;while(t--){int n,flag=0;memset(v,0,sizeof(v));cin>>n;if(n>=1000){flag=1;n%=1000;}int i=0,k=1,count;while(1){i++;k*=n;if(k>=1000 || flag){k%=1000;if(!v[k])v[k]=i;else {count=v[k];break;}flag=1;}}cout<<count+i<<endl;}return 0;}

#include<iostream>#include<string.h>using namespace std;int a[1111],v[1111];int main(){    int n;    while(cin>>n && n)    {        int flag=0;        memset(v,0,sizeof(v));        if(n>=1000)        {            flag=1;            n%=1000;        }        int i=0,k=1,count;        while(1)        {            i++;            k*=n;            if(k>=1000 || flag)            {                k%=1000;                if(!v[k])                    v[k]=i;                else                {                    count=v[k];                    break;                }                flag=1;            }        }        cout<<count+i<<endl;    }    return 0;}