Cod sursa(job #692384)
Utilizator | Data | 26 februarie 2012 15:31:23 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<iostream>
#include <fstream>
using namespace std;
long long N,i,j,k=0,v[1000001];
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
f>>N;
for(i=1;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]=v[j]*(i-1)/i;
}
}
for(i=2;i<=N;i++)
k+=v[i];
g<<2*k+1;
return 0;
}