ProjectEuler/P72.cpp at master · AbhishekYMCA/ProjectEuler · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include<iostream>
#include<fstream>
#include<string>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<algorithm>
#include<math.h>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iomanip>
#define MAXN 1000000
#define MOD 10000000000
#define LL long long
#define eps 1e-8
#define inf 0x3f3f3f3f
using namespace std;

int prime[MAXN], Phi[MAXN + 1] = {0, 1};
bool comp[MAXN + 1];

void getprime()
{
    for(int p = 2; p <= MAXN; p++)
    {
        if(!comp[p])
        {
            for(int i = p + p; i <= MAXN; i += p)
                comp[i] = true;
            prime[++prime[0]] = p;
        }
    }
    return;
}

int Totient(int n)
{
    if(!comp[n])
        Phi[n] = n - 1;
    else if(0 == Phi[n])
    {
        int m = 1, i = 1, k = n;
        while(n % prime[i])
            i++;
        while(0 == k % prime[i])
        {
            m *= prime[i];
            k /= prime[i];
        }
        Phi[n] = Phi[m] * Phi[k];//m * k == n
        // The totient function is a multiplicative function
        //if two numbers m and n are relatively prime, then φ(mn) = φ(m)φ(n).
    }
    //φ(n^k) = n^(k - 1)φ(n) = n * φ(n^(k - 1))
    for(LL t = (LL)n * n; t <= MAXN; t *= n)
        Phi[t] = n * Phi[t / n];
    return Phi[n];
}

int main()
{
    clock_t start = clock();
    getprime();
    LL cnt = 0;
    for(int i = 2; i <= MAXN; i++)
        cnt += Totient(i);
        //printf("%d %d\n", i, NumOfFrac[i]);
    printf("%I64d\n", cnt);
    printf("time cost: %lf", (double)( clock() - start) / CLOCKS_PER_SEC);
    return 0;
}
/*A faster way
类似于扫描法求质数
	for(int i = 1; i <= MAXN; i++)
        Phi[i] = i;
	for(int i = 2; i <= MAXN; i++)
	{
		if(Phi[i] == i)
		{
			for(int j = i;j <= MAXN; j += i)
				Phi[j] = Phi[j] / i * (i - 1);
		}
	}
	LL ans = 0LL;
	for(int i = 2;i <= MAXN; i++)
		ans += Phi[i];
	printf("%I64d\n", ans);
*/