Cod sursa(job #1864785)
Utilizator | Data | 31 ianuarie 2017 23:57:04 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout("fractii.out");
int n,fi[1000010],i,j;
long long s;
int main()
{
fin >> n;
//fi[1]=1;
for (i=2;i<=n;++i)
{
fi[i]+=i-1;
s+=fi[i]*2;
for (j=i+i;j<=n;j+=i)
{
fi[j]-=fi[i];
}
}
fout <<s+1;
return 0;
}