Cod sursa(job #677205)
| Utilizator | Data | 9 februarie 2012 22:04:59 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
using namespace std;
#include<fstream>
int main()
{
ifstream fcin("fractii.in");
ofstream fcout("fractii.out");
long long n,i,j,nr=0,ciur[1000000];
fcin>>n;
for(i=1;i<=n;i++)
ciur[i]=i;
for(i=2;i<=n;i++)
if (ciur[i]==i)
for(j=i;j<=n;j+=i)
ciur[j]/=i, ciur[j]*=(i-1);
for(i=2;i<=n;i++)
nr+=ciur[i];
fcout<<2*nr+1;
fcin.close();
fcout.close();
return 0;
}
