Pagini recente » Rating Tudor Moldovan (tudorrr) | Cod sursa (job #2485632) | Cod sursa (job #166435) | Cod sursa (job #1641191) | Cod sursa (job #1402852)
#include <iostream>
#include <fstream>
using namespace std;
long long phi(long long n) {
long long result = n;
for (long long i=2; i*i<=n; ++i)
if (n % i == 0) {
while (n % i == 0)
n /= i;
result -= result / i;
}
if (n > 1)
result -= result / n;
return result;
}
long long n,answer;
int main()
{
ifstream fin("fractii.in");
cin>>n;
answer=1;
for(long long i=2;i<=n;i++){
answer+=2*phi(i);
}
ofstream fout("fractii.out");
cout << answer ;
return 0;
}