【BZOJ1403】Divisibility Testing（数论）

题意：

思路：

 #include<cstdio>
 #include<cstdlib>
 #include<algorithm>
 #include<map>
 #include<set>
 #include<iostream>
 #include<cstring>
 typedef long long LL;
 using namespace std;

 int b,n,ans1,ans2,ans3,k;

 int main()
 {
      freopen("bzoj1403.in","r",stdin);
      freopen("bzoj1403.out","w",stdout);
      for(int v=;v<=;v++)
      {
          scanf("%d%d",&b,&n);
         ans1=; ans2=; ans3=;
         k=;
         for(int i=;i<=;i++)
         {
           k=k*b%n;
           if((!k)&&(!ans1)) ans1=i;
           if((k==)&&(!ans2)) ans2=i;
           if((k==n-)&&(!ans3)) ans3=i;
         }
         if(!(ans1+ans2+ans3)) printf("condition not found.\n");
         if(ans1) printf("Rightmost %d\n",ans1);
         if(ans2) printf("Add all %d\n",ans2);
         if(ans3) printf("Alternate %d change sign\n",ans3);

         printf("\n");
      }
      return ;
 }