Pagini recente » Cod sursa (job #1456593) | Cod sursa (job #2098946) | Cod sursa (job #353985) | Cod sursa (job #1287816) | Cod sursa (job #732832)
Cod sursa(job #732832)
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
int Phi[1000005];
ifstream f("fractii.in");
ofstream g("fractii.out");
long long int Nr(int N)
{
long long Nr=0;
int i,j;
for (i=1; i<=N; i++)
Phi[i]=i-1;
for (i=2; i<=N; i++)
for (j=2; j*i<=N; j++)
Phi[i*j]-=Phi[j];
for (i=2; i<=N; i++)
Nr+=2*Phi[i];
return Nr;
}
int main()
{
int N;
f>>N;
g<<Nr(N)+1;
f.close();
g.close();
return 0;
}