Cod sursa(job #2529017)
Utilizator | Data | 22 ianuarie 2020 21:00:38 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define N 1000001
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n;
int l[N];
long long Ciur();
int main()
{
fin>>n;
fout<<Ciur()<<'\n';
return 0;
}
long long Ciur()
{
long long s=n;
for(int i=2;i<=n;i++)
{
l[i]++;
int x=n/i-1;
for(int j=2;i*j<=n;j++)
{
if(i%j!=0 || i==j) {l[i*j]+=x; l[i]++;}
}
s+=n-l[i];
}
return s;
}