Cod sursa(job #958051)
Utilizator | Alexandru Dumitru lecss | Data | 6 iunie 2013 21:14:57 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int GCD(int a, int b){
printf("%d-%d\n", a,b);
if(!a) return b;
if(!b) return a;
if(a > b) return GCD(a-b,a);
else return GCD(a, b-a);
}
int main()
{
int T, a,b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdin);
scanf("%d", &T);
for(; T; --T)
{
scanf("%d %d", &a, &b);
printf("%d\n", GCD(a,b));
}
return 0;
}