Cod sursa(job #1844138)
Utilizator | Data | 9 ianuarie 2017 19:31:42 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
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");
long long n,i,A[1000001],j,rez;
int main()
{
fi>>n;
for(i=1; i<n; i++)
A[i+1]=i;
for(i=2; i<=n; i++)
{
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;
}