Cod sursa(job #1066368)
Utilizator | Data | 24 decembrie 2013 16:47:22 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | riad2 | Marime | 0.43 kb |
#include<fstream>
using namespace std;
int n,v[1000000];
long long c;
int main()
{
int i, j;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
for(i=2; i<=n; i++)
v[i]=i-1;
for(i=2; i<=n; i++)
{for(j=2*i; j<=n; j=j+i)
v[j]=v[j]-v[i];
}
for(i=2; i<=n; i++)
c=c+v[i];
fout<<c*2+1;
fin.close();
fout.close();
return 0;
}