Uva 10294 Polya

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

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

const int maxn = ;

int main()
{
    int t,n;
    while(scanf("%d%d",&n,&t)!=EOF) {
        LL pow[maxn];
        pow[] = ;
        for(int i=;i<=n;i++)
            pow[i] = pow[i-] * t;

        LL a = ;
        for(int i=;i<n;i++)
            a +=pow[gcd(i,n)];
        LL b = ;
        if(n%==) b = n*pow[(n+)/];
        else b = n/*pow[n/] + n/*pow[n/+];
        printf("%lld %lld\n",a/n,(a+b)//n);

    }

    return ;
}