Cod sursa(job #2303972)
Utilizator | Data | 17 decembrie 2018 12:54:32 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#define MAXN 1000000
#define ll long long
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
ll phi[MAXN];
int main(){
int n,s=0;
fin>>n;
for(int i=1;i<=n;i++){
phi[i]=i-1;
}
for(int i=2;i<=n;i++){
for(int j=2*i;j<=n;j+=i)
phi[j]-=phi[i];
s+=2*phi[i];
}
fout<<s+1;
return 0;
}