Cod sursa(job #2191102)
Utilizator | Data | 1 aprilie 2018 17:22:07 | |
---|---|---|---|
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");
long long k;
int n, v[1000002];
int main()
{
fin>>n;
for(int i=1; i<=n; ++i)
{
v[i]=i-1;
}
for(int i=2; i<=n; ++i)
{
k=k+v[i];
for(int j=i*2; j<=n; j+=i)
{
v[j]=v[j]-v[i];
}
}
fout<<k*2+1;
}