Cod sursa(job #3273195)
| Utilizator | Data | 1 februarie 2025 11:26:03 | |
|---|---|---|---|
| Problema | Fractii | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | cex_8 | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int m=100001;
int n,v[1000001];
long long s;
int main()
{
for(int i=1;i<=m;i++) {
v[i]=i;
}
for(int i=2;i<=m;i++)
{
if(v[i]==i)
{
v[i]--;
for(int j=2;j*i<=m;j++) {
v[j*i]=v[j*i]/i*(i-1);
}
}
}
fin>>n;
for(int i=1;i<=n;i++)
{
s+=v[i];
}
fout<<s*2-1;
return 0;
}
