Cod sursa(job #1844143)
Utilizator | Data | 9 ianuarie 2017 19:38:29 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream fi("fractii.in");
ofstream fo("fractii.out");
int n,i,A[1000001],j;
long long rez;
int main()
{
fi>>n;
rez=1;
for(i=1; i<=n; i++)
{
A[i]=A[i]+i-1;
rez=rez+2LL*A[i];
for(j=2*i; j<=n; j+=i)
{
A[j]-=A[i];
}
}
fo<<rez<<"\n";
fi.close();
fo.close();
return 0;
}