Cod sursa(job #2476757)
Utilizator | Data | 19 octombrie 2019 11:21:57 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n;
long long a[1000003],rez=1;
void ciur()
{
a[1]=1;
for(int i=2;i<=n;i++)
a[i]=i-1;
for(int d=2;d*2<=n;d++)
{
for(int i=2;i*d<=n;i++)
a[i*d]-=a[d];
}
for(int i=2;i<=n;i++)
rez+=2*a[i];
}
int main()
{
ifstream fin("fractii.in");
fin>>n;
ciur();
ofstream fout("fractii.out");
fout<<rez;
return 0;
}