Cod sursa(job #2682548)
| Utilizator | Data | 8 decembrie 2020 21:18:56 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int NMAX=1000001;
int v[NMAX];
int main()
{
long long n,i,s,j;
fin>>n;
for( i=2;i<=n;i++)
v[i]=i-1;
for( i=2;i<=n;i++)
{
s=s+v[i];
for( j=2*i;j<=n;j+=i)
v[j]-=v[j]-v[i];
}
fout<<s*2+1 << '\n';
return 0;
}
