Pagini recente » Borderou de evaluare (job #1256092) | Borderou de evaluare (job #1488266) | Borderou de evaluare (job #2043184) | Cod sursa (job #2397055) | Cod sursa (job #89005)
Cod sursa(job #89005)
#include <stdio.h>
long n, nr=0;
void cit()
{
FILE *f = fopen("fractii.in", "r");
fscanf(f, "%ld", &n);
fclose(f);
}
void tip()
{
FILE *f = fopen("fractii.out", "w");
fprintf(f, "%ld", nr);
fclose(f);
}
int prime(int i, int j)
{
do
{
if (i>j) i-=j;
else j-=i;
}while (i && j);
if (i==1 || j==1) return 1;
return 0;
}
void num_fractii(long n)
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
if (prime(i, j)) nr++;
}
}
int main()
{
cit();
num_fractii(n);
tip();
return 0;
}