Pagini recente » Cod sursa (job #3288599) | Rating Mihail Prunaru (Mihailprunaru) | Cod sursa (job #1870504) | Cod sursa (job #2951167) | Cod sursa (job #1071779)
#include<cstdio>
FILE *in,*out;
using namespace std;
unsigned long Scai[999999];
unsigned long i,j,N;
int main()
{
in=fopen("fractii.in","rt");
fscanf(in,"%lu ",&N);
fclose(in);
for (i=2;i<=N;i++)
Scai[i]=i-1;
for (i=2; i<=N; i++)
for (j=2*i; j<=N; j+=i)
Scai[j]=Scai[j]-Scai[i];
unsigned long raspuns=1;
for (i=2; i<=N; i++)
raspuns+=(Scai[i]*2);
out=fopen("fractii.out","wt");
fprintf(out,"%lu", raspuns);
fclose(out);
return 0;
}