Cod sursa(job #1453343)
Utilizator | Data | 23 iunie 2015 12:46:39 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int phi[1000005];
int main()
{
int n,s=0;
f>>n;
for(int i=1;i<=n;i++)
phi[i]=i;
for(int i=1;i<=n;i++)
for(int j=i+i;j<=n;j+=i)
phi[j]-=phi[i];
for(int i=1;i<=n;i++)
s+=phi[i];
g<<s*2-1;
return 0;
}