Cod sursa(job #2664697)
Utilizator | Data | 29 octombrie 2020 10:16:59 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin("fibofrac.in");
ofstream cout("fibofrac.out");
int v[10001];
int main()
{
long long n,r=0;
cin >> n;
for(int i=2; i<=n; i++)
{
v[i]=i;
}
for(int i=2; i<=n; i++)
{
if(v[i]==i)
{
for(int j=1; j*i<=n; j++)
{
v[j*i]=v[j*i]/i*(i-1);
}
}
}
for(int i=2; i<=n; i++)
{
r+=v[i];
}
cout << 2*r+1;
return 0;
}