Cod sursa(job #2182656)
| Utilizator | Data | 22 martie 2018 16:08:50 | |
|---|---|---|---|
| Problema | Fractii | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
int main()
{
int n;
long long v[10003],sum=0;
fin>>n;
for(int i=1;i<=n;++i)v[i]=i;
for(int i=2;i<=n;++i){
if(v[i]==i)
for(int j=2*i;j<=n;j+=i)
v[j]=v[j]*(i-1)/i;
sum+=(v[i]==i?i-1:v[i]);
}
fout<<2*sum+1<<'\n';
return 0;
}
