Cod sursa(job #878010)
Utilizator | Data | 13 februarie 2013 18:42:12 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
long long x[1000001];
int main()
{
int n,i,j;
long long s;
ifstream f("date.in");
ofstream g("date.out");
f>>n;
s=0;
for(i=1;i<=n;i++)x[i]=i;
for(i=2;i<=n;i++)
if(x[i]==i)
for(j=i;j<=n;j+=i)x[j]=x[j]/i*(i-1);
for(i=2;i<=n;i++)
s=s+x[i];
g<<(2*s)+1;
f.close();
g.close();
return 0;
}