Cod sursa(job #2381990)
| Utilizator | Data | 17 martie 2019 15:27:54 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int x[1000005];
long long n, cnt;
void rezolva()
{
fin>>n;
for(long long i=1; i<=n; i++)
x[i]=i-1;
for(long long i=2; i<=n; i++)
for(long long j=2*i; j<=n; j+=i)
x[j]-=x[i];
for(long long i=2; i<=n; i++)
cnt+=x[i];
cnt=cnt*2+1;
fout<<cnt;
}
int main()
{
rezolva();
return 0;
}
