Cod sursa(job #1870187)
Utilizator | Data | 6 februarie 2017 14:19:36 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,q[1000010],i,j;
long long s;
int main()
{
f>>n;
for(i=2;i<=n;++i)
{
q[i]+=i-1;
for (j=2*i;j<=n;j+=i)
{
q[j]-=q[i];
}
s+=q[i]*2;
}
g<<s+1;
return 0;
}