Cod sursa(job #1400766)
Utilizator | Data | 25 martie 2015 13:57:32 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("fractii.in");ofstream fout("fractii.out");
int n,frac[1000001],j,i;unsigned long long cate;
int main()
{
fin>>n;
for(i=2;i<=n;i++)
frac[i]=i-1;
for(i=2;i<=n;i++)
{
for(j=i<<1;j<=n;j+=i)
frac[j]-=frac[i];
cate+=frac[i];
}
fout<<2*cate+1;
return 0;
}