Cod sursa(job #675122)
| Utilizator | Data | 7 februarie 2012 10:56:14 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main (void)
{
ifstream in("fractii.in");
ofstream out("fractii.out");
long long i,j,n,count=0,phi[1000000];
in>>n;
in.close();
for (i=1;i<=n;i++)
phi[i]=i;
for (i=2;i<=n;i++)
if (phi[i]==i)
for (j=i;j<=n;j+=i)
phi[j]/=i, phi[j] *= (i-1);
for (i=2;i<=n;i++)
count=count+phi[i];
out<<(2*count)+1;
out.close();
return 0;
}
