Cod sursa(job #1247009)
| Utilizator | Data | 21 octombrie 2014 22:35:15 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
#include <stdlib.h>
#define PAIRS 100000
int main()
{
FILE *inputFile = fopen("euclid2.in", "r");
FILE *outputFile = fopen("euclid2.out","w");
int pairs;
int num1, num2, saver;
fscanf(inputFile, "%d", &pairs);
while(pairs--) {
fscanf(inputFile, "%d %d", &num1, &num2);
while(num2 != 0) {
saver = num2;
num2 = num1 % num2;
num1 = saver;
}
fprintf(outputFile, "%d\n", num1);
}
fclose(inputFile);
fclose(outputFile);
return 0;
}
