BAPC 2014 Preliminary A

Choosing Ice Cream

问题分析

求一个最小的$\,i\,$满足$k^{i}\:mod\:n = 0$
因为数据最大只有$\,1e9\,$，所以我们利用同余定理，每次最多枚举29次就够了。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
const int N = 1e5+3, inf = 1e9+7;

int t;

long pow(long k,long i,long n)
{
    long ac = 1%n;
    for(int j = 0; j < i; ++j)
        ac = (ac*k)%n;
    return ac;
}

long gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}

int main()
{
    //freopen("in.txt","r",stdin);
    cin>>t;
    while(t--)
    {
        int n,k, i = 0;
        cin>>n>>k;
        /*for(int j = 1; j <= n; j <<= 1){
            if(pow(k,i,n)==0){
                cout<<i<<endl;
                f = 1;
                break;
            }
            i++;
        }
        if(!f) cout<<"unbounded"<<endl;
         */
        long long p = 1%n;
        for(i = 0; i < 30&&p; ++i,p = (p*k)%n);
        i==30?cout<<"unbounded\n":cout<<i<<endl;
    }

    return 0;
}