Cod sursa(job #1429970)
Utilizator | Data | 7 mai 2015 17:49:34 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
using namespace std;
long long v[1000002],s;
int i,n,j;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=2;i<=n;i++)
{
v[i]=i;
}
for(i=2;i<=n;i++)
{
if(v[i]==i)
{
for(j=i;j<=n;j+=i)
{
v[j]/=i;
v[j]*=(i-1);
}
}
}
for(i=2;i<=n;i++)
{
s+=v[i];
}
g<<2*s+1;
return 0;
}