Cod sursa(job #1420343)
Utilizator | Data | 18 aprilie 2015 12:30:19 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long n,s,v[1000001],i,j;
int main()
{
f>>n;
v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
v[i]=i-1;
for(j=i*2;j<=n;j+=i)
{
if(v[j]==0)
v[j]=(j/i)*(i-1);
else
v[j]=(v[j]/i)*(i-1);
}
}
s+=v[i];
}
g<<2*s+1;
return 0;
}