Cod sursa(job #2207935)
| Utilizator | Data | 27 mai 2018 14:28:59 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<cstdio>
using namespace std;
inline int Euclid(int a, int b) {
int r;
while(b) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
int n, x, y, i;
FILE* fin, *fout;
fin = fopen("euclid2.in","r");
fout = fopen("euclid2.out","w");
fscanf(fin,"%d",&n);
for(i = 1; i <= n; i++) {
fscanf(fin,"%d%d",&x,&y);
fprintf(fout,"%d\n",Euclid(x,y));
}
fclose(fin);
fclose(fout);
return 0;
}
