http://acm.hdu.edu.cn/showproblem.php?pid=3501
当你发现如果x(x<n)与n互素,则(n-x)也与n互素时,它就成为了一道水题。
Orz.
代码:
// Header.
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <set>
#include <map>
using namespace std;
// Macro
typedef long long LL;
#define TIME cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s." << endl;
#define IN freopen("/Users/apple/input.txt", "r", stdin);
#define OUT freopen("/Users/apple/out.txt", "w", stdout);
#define mem(a, n) memset(a, n, sizeof(a))
#define rep(i, n) for(int i = 0; i < (n); i ++)
#define REP(i, t, n) for(int i = (t); i < (n); i ++)
#define FOR(i, t, n) for(int i = (t); i <= (n); i ++)
#define ALL(v) v.begin(), v.end()
#define Min(a, b) a = min(a, b)
#define Max(a, b) a = max(a, b)
#define put(a) printf("%d\n", a)
#define ss(a) scanf("%s", a)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define siii(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define VI vector<int>
#define pb push_back
const int inf = 0x3f3f3f3f, N = 1e2 + 5, MOD = 1e9 + 7;
// Macro end
int T, cas = 0;
int n, m;
// Imp
int euler_phi(int n) {
int ret = n, m = (int)sqrt(n + 0.5);
FOR(i, 2, m) if(n % i == 0) {
ret = ret / i * (i - 1);
while(n % i == 0) n /= i;
} if(n > 1) ret = ret / n * (n - 1);
return ret;
}
void phi_table(int n, int * phi) {
mem(phi, 0);
phi[1] = 1;
FOR(i, 2, n) {
if(!phi[i]) {
for(int j = i; j <= n; j += i) {
if(!phi[j]) phi[j] = j;
phi[j] = phi[j] / i * (i - 1);
}
}
}
}
int main(){
#ifdef LOCAL
IN;
// OUT;
#endif
while(si(n), n) {
int num = euler_phi(n);
int ans = ((LL)(n - num - 1) * (LL)n/ 2) % MOD;
put(ans);
}
return 0;
}