Cod sursa(job #2741944)
| Utilizator | Data | 19 aprilie 2021 19:55:42 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int ciur[1000001],i,j;
long long fi[1000001];
int main()
{
for(i=2;i<=1000000;i++)
fi[i]=i;
for(i=2;i<=1000000;i++)
if(!ciur[i])
{
for(j=i*2;j<=1000000;j+=i)
{
ciur[j]=true;
fi[j]/=i;
fi[j]*=i-1;
}
fi[i]=i-1;
}
for(i=1;i<=1000000;i++)
fi[i]=fi[i-1]+fi[i];
int n;
fin>>n;
fout<<fi[n]*2+1;
return 0;
}
