Cod sursa(job #2402654)
Utilizator | Data | 10 aprilie 2019 21:34:13 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int v[1000000];
int main()
{
int n,i,j;
long long s=0;
in>>n;
for(i=1;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
{
v[i]--;
for(j=2*i;j<=n;j=j+i)
v[j]=v[j]-v[i];
}
for(i=1;i<=n;i++)
s=s+2*v[i];
s--;
out<<s;
return 0;
}