置换问题

---

Arif in Dhaka (First Love Part 2)

题目传送：UVA - 10294 - Arif in Dhaka (First Love Part 2)

AC代码:

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <sstream>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>
#define LL long long
#define INF 0x7fffffff
using namespace std;

const int maxn = 105;
int n, t;

LL jiechen[maxn] = {1};

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

int main() {
    while(scanf("%d %d", &n, &t) != EOF) {
        if(n == 0) break;
        for(int i = 1; i <= n; i ++) {
            jiechen[i] = jiechen[i - 1] * t;
        }
        LL a = 0;
        for(int i = 0; i < n; i ++) a += jiechen[gcd(i, n)];
        LL b = 0;
        if(n & 1) b = n * jiechen[(n + 1) / 2];
        else b = (n / 2) * (jiechen[n/2 + 1] + jiechen[n/2]);
        printf("%lld %lld\n", a / n, (a + b) / 2 / n);
    }
    return 0;
}

---