Cod sursa(job #1301292)
Utilizator | Data | 25 decembrie 2014 19:35:28 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
long long x[1000001], n, i, j, nr;
int main()
{
cin>>n;
for(i=2;i<=n;i++)
x[i]=i-1;
for(i=2;i<=n;i++)
{
nr+=x[i];
for(j=i+i;j<=n;j+=i)
x[j]-=x[i];
}
cout<<2*nr+1<<'\n';
return 0;
}