Pagini recente » Cod sursa (job #188944) | Cod sursa (job #2875944) | Cod sursa (job #2271831) | Cod sursa (job #2862068) | Cod sursa (job #1828064)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream inf("fractii.in");
ofstream outf("fractii.out");
int n, euler[1000010];
long long sol=1;
int main()
{
inf>>n;
for(int i=2; i<=n; i++)
euler[i]=i;
for(int i=2; i<=n; i++)
{
if(euler[i]==i)
for(int j=i;j<=n;j+=i)
euler[j]=euler[j]/i*(i-1);
sol+=2*euler[i];
}
outf<<sol<<"\n";
return 0;
}