Pagini recente » Cod sursa (job #1155900) | Cod sursa (job #565722) | Cod sursa (job #2349199) | Cod sursa (job #3215784) | Cod sursa (job #112810)
Cod sursa(job #112810)
#include <stdio.h>
#include <malloc.h>
unsigned long n;
int* totient;
unsigned long calcul(int n)
{
int i,j,s=0;
for (i=0; i<=n; i++)
totient[i]=1;
for(i=2; i<=n/2; i++)
{
if (totient[i]==1)
{
for (j=i+1; j<=n; j++)
if (j%i==0)
{
if (totient[j]>1) totient[j]=totient[j]*(i-1)/i;
else totient[j]=j*(i-1)/i;
}
}
if (totient[i]==1) totient[i]=i-1;
s+=totient[i];
}
for (i=n; i>n/2; i--)
{
if (totient[i]==1) totient[i]=i-1;
s+=totient[i];
}
return s;
}
int main()
{
FILE *f, *g;
f=fopen("fractii.in","r");
fscanf(f,"%lu",&n);
totient=(int*) malloc ((n+1)*sizeof(int));
g=fopen("fractii.out","w");
fprintf(g,"%lu",2*calcul(n)+1);
return 0;
}