Cod sursa(job #2358955)
Utilizator | Data | 28 februarie 2019 15:00:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int gcd(int a, int b){
if (!b)
return a;
return gcd(b, a % b);}
int main(void){
int NrPerechi, A, B;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &NrPerechi);
while(NrPerechi){
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
NrPerechi--;}
return 0;}