Cod sursa(job #2099676)
Utilizator | Data | 4 ianuarie 2018 16:38:52 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int phi[1000001];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
f>>n;
for(int i=2; 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];
}
}
int s=0;
for(int i=2; i<=n; i++) s+=phi[i];
g<<2*s+1;
return 0;
}