Cod sursa(job #2445193)
Utilizator | Data | 3 august 2019 07:41:48 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
#define nmax 1000001
int n,v[nmax];
long long nr;
int main()
{
f>>n;
for(int i=2;i<=n;i++)
v[i]=i-1;
for(int i=2;i<=n;i++)
{
nr+=v[i];
for(int j=2*i;j<=n;j=j+i)
v[j]=v[j]-v[i];
}
g<<nr*2+1;
return 0;
}