Pagini recente » Cod sursa (job #1934488) | Borderou de evaluare (job #273810) | Cod sursa (job #679055) | Cod sursa (job #2727505) | Cod sursa (job #1974690)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long int p,n,b[1000000],i,j,k;
int phi(int n)
{
int sol=n;
for(int i=2;i<=(int)sqrt(n);i++)
{
if(n%i==0)
{sol=sol-sol/i;
n=n/i;}
while(n%i==0)
n=n/i;
}
if(n>1)
sol=sol-sol/n;
return sol;
}
int main()
{
fin>>n;
p=3;
for(i=3;i<=n;i++)
{
b[i]=phi(i);
p=p+b[i]*2;}
fout<<p;
return 0;
}