Cod sursa(job #2322456)
Utilizator | Data | 17 ianuarie 2019 20:00:28 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int phi[1000000];
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{ int n;
long long S=0;
fin>>n;
for(int i=1;i<=n;i++)
{
phi[i]=i-1;
S+=phi[i];
}
for(int i=2; i<=n;i++)
for(int j=2*i; j<=n; j+=i){
phi[j]-=phi[i];
S-=phi[i];
}
S=S*2+1;
fout<<S;
return 0;
}