Cod sursa(job #2465946)
Utilizator | Data | 1 octombrie 2019 09:03:34 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
using namespace std;
constexpr int NX = 10000;
int main()
{
int n, fi[10];
cin>>n;
for(int i=1; i<=n; ++i)
fi[i]=i;
for(int i=2; i<=n; ++i)
{
if(fi[i]==i)
for(int d=i; d<=n; d+=i)
{
fi[d]*=(i-1);
fi[d]/=i;
}
}
int s{1};
for(int i=2; i<=n; ++i)
s+=2*fi[i];
cout<<s;
return 0;
}