Pagini recente » Cod sursa (job #656851) | Cod sursa (job #2723079) | Cod sursa (job #2439585) | Cod sursa (job #2278636) | Cod sursa (job #2033949)
#include <iostream>
#include <fstream>
using namespace std;
int v[1000000];
int n;
int test(int x,int p)
{
int i=1;
int x2=x;
while (x%p==0)
{
x=x/p;
i=i*p;
}
return i;
}
int ciur()
{
int i,j;
v[0]=1;
v[1]=1;
for (i=4;i<=n;i=i+2)
{
v[i]=1;
}
for (i=3;i*i<=n;i=i+2)
{
for (j=i*i;j<=n;j=j+i*2)
v[j]=1;
}
int p,c;
v[2]=1;
for (i=4;i<=n;i=i+2)
{
p=test(i,2);
v[i]=p-p/2;
// cout<<i<<" "<<p<<" "<<p/2<<" "<<v[i]<<"\n";
}
for (i=3;i<=n;i=i+2)
{
if (v[i]==0)
{
v[i]=i-1;
for (j=i+i;j<=n;j=j+i)
{
p=test(j,i);
v[j]=v[j]*(p-p/i);
}
}
}
int s=0;
for (i=2;i<=n;i++)
s=s+v[i];
return s*2+1;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>n;
out<<ciur();
int i;
out.close();
in.close();
return 0;
}