Pagini recente » Cod sursa (job #2844972) | Cod sursa (job #2554969) | Cod sursa (job #229765) | Cod sursa (job #2059006) | Cod sursa (job #1740112)
#include <stdio.h>
int prim (int a, int b) {
while ( a != b)
{
if ( a > b)
a = a -b;
else
b = b - a;
}
if ( a == 1)
return 1;
else return 0;
}
int main() {
FILE *f = fopen ("fractii.in", "r");
FILE *g = fopen ("fractii.out", "w");
int i = -1, numere[100], j, permutari, k, l;
while (!feof(f)) {
fscanf (f, "%d", &numere[i + 1]);
i++;
}
for (j = 0; j < i; j++) {
permutari = numere[j] * numere[j];
for (k = 1; k <= numere[j]; k++) {
for (l = 1; l <= numere[j]; l++) {
if (l == k && l != 1) {
permutari--;
}
if ( prim(k, l) == 0 && l != k) {
permutari--;
}
}
}
fprintf(g,"%d\n", permutari);
}
fclose(f);
fclose(g);
return 0;
}