Pagini recente » Cod sursa (job #346772) | Diferente pentru problema/inversmodular intre reviziile 117 si 9 | Cod sursa (job #2048853) | Borderou de evaluare (job #1520217) | Cod sursa (job #420879)
Cod sursa(job #420879)
#include <stdio.h>
FILE *f=fopen("fractii.in","r"),*g=fopen("fractii.out","w");
int n,i,x[1000001],j;
long long nr;
int main(void)
{
fscanf(f,"%d",&n);
for (i=2;i<=n;i++)
{
x[i]=i-1;
}
for (i=2;i<=n;i++)
{
nr=nr+x[i];
for (j=i*2;j<=n;j=j+i)
x[j]=x[j]-x[i];
}
nr=nr*2+1;
fprintf(g,"%lld",nr);
fclose(g);
return 0;
}