Cod sursa(job #1700290)
Utilizator | Data | 9 mai 2016 23:12:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
using namespace std;
inline int euclid(int a, int b) {
int c;
while(b) {
c=a%b;
a=b;
b=c;
}
return a;
}
int main(void) {
FILE *fi = fopen("euclid.in", "r");
FILE *fo = fopen("euclid.out", "w");
int n, a, b;
fscanf(fi,"%d",&n);
while(n--) {
fscanf (fi,"%d%d",&a,&b);
fprintf (fo,"%d\n",euclid(a, b));
}
return 0;
}