Cod sursa(job #2120789)
Utilizator | Data | 2 februarie 2018 21:29:28 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[1000001];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int i,n;
f>>n;
for(int i=1;i<=1000000;++i)
{
v[i]=i-1;
}
for(int i=2;i<=1000000;++i)
{
for(int j=2*i;j<=1000000;j+=i)
v[j]-=v[i];
}
long long sum=0;
for(i=1;i<=n;++i) {
sum+=v[i];
}
g<<2*sum+1<<'\n';
return 0;
}