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