Pagini recente » Cod sursa (job #2574406) | Cod sursa (job #129878) | Cod sursa (job #956170) | Cod sursa (job #686752) | Cod sursa (job #815090)
Cod sursa(job #815090)
#include <fstream>
using namespace std;
int main()
{
long long N, i, j, phi[1000001];
long long S=1;
ifstream fin;
fin.open("fractii.in");
fin>>N;
fin.close();
for (i=1; i<=N; i++)
{
phi[i]=i;
}
for (i=2; i<=N; i++)
{
if (phi[i]==i)
{
for (j=i; j<=N; j+=i)
{
phi[j]/=i;
phi[j]*=(i-1);
}
}
}
for (i=2; i<=N; i++)
{
S+=2*phi[i];
}
ofstream fout;
fout.open("fractii.out");
fout<<S;
fout.close();
return 0;
}