Pagini recente » Cod sursa (job #1248206) | Cod sursa (job #2711058) | Cod sursa (job #867936) | Cod sursa (job #1275609) | Cod sursa (job #2333925)
#include <stdio.h>
#include <math.h>
unsigned int N;
unsigned int C; //counts the irreducible fractions
#define True (1==1)
#define False (1==0)
unsigned char irreducible(unsigned int n, unsigned int m)
{
register unsigned int i;
if (m == 1)
{
return True;
}
if (n % m == 0)
{
return False;
}
for (i = 2; i <= ((unsigned int)sqrt(n)); ++i)
{
if (n % i == 0)
{
if (m % i == 0)
{
return False;
}
}
}
return True;
}
int main(void)
{
register unsigned int i, j;
FILE * fp;
C = 0;
//read input
fp = fopen("fractii.in", "r");
fscanf(fp, "%d", &N);
fclose(fp);
for (i = 1; i <= N; ++i)
{
for (j = 1; j <= N; ++j)
{
//printf("case%d/%d\n", i, j);
if (irreducible(i, j))
{
printf("case%d/%d\n", i, j);
++C;
}
}
}
//write result
fp = fopen("fractii.out", "w");
fprintf(fp, "%d", C);
fclose(fp);
return 0;
}