Pagini recente » Cod sursa (job #1320264) | Cod sursa (job #516828) | Cod sursa (job #919375) | Cod sursa (job #2786856) | Cod sursa (job #28489)
Cod sursa(job #28489)
#include<fstream.h>
int e[100],n;
int pr[100],num[100];
long long int s=1;
long long int r;
int main()
{
int i,j;
ifstream f("fractii.in");
f>>n;
f.close();
for(i=1;i<=n;i++)
{
e[i]=1;
pr[i]=1;
num[i]=1;
}
for(i=2;i<=n/2;i++)
if(e[i]==1)
for(j=2;j*i<=n;j++)
e[i*j]=0;
for(i=2;i<=n;i++)
{
if(e[i]==1)
{
pr[i]=i-1;
for(j=2;j*i<=n;j++)
{
pr[i*j]*=i-1;
num[i*j]*=i;
}
r=pr[i];
}
else
r=pr[i]*i/num[i];
s+=2*r;
}
ofstream g("fractii.out");
g<<s<<"\n";
g.close();
return 0;
}