Cod sursa(job #1366638)
Utilizator | Data | 1 martie 2015 12:23:56 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,phi[1000010];
int main(){
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin >> N;
long long cnt=0;
int i,j;
for (i=2; i<=N; i++){
if (!phi[i]){
for (j=i; j<=N; j+=i){
if (!phi[j]) phi[j]=j;
phi[j]=phi[j]/i*(i-1);
}
}
cnt+=phi[i];
}
fout << 2*cnt+1;
return 0;
}