Cod sursa(job #248015)
Utilizator | Vlad Schnakovszki shnako | Data | 24 ianuarie 2009 17:51:45 |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream.h>
long v[1000001];
long n;
void fract ()
{
long i,j;
for ( i = 1; i <= n; ++i)
v[i] = i-1;
for ( i = 2; i <= n; ++i)
for ( j = 2*i; j <= n; j += i)
v[j] -= v[i];
}
int main ()
{
long long k=0,h;
long i;
fstream f("fractii.in",ios::in);
fstream g("fractii.out",ios::out);
f>>n;
fract();
for(i=2;i<=n;i++)
{
k=k+v[i];
}
h=2*k+1;
g<<h;
return 0;
}