Cod sursa(job #760303)
Utilizator | Data | 20 iunie 2012 21:28:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int gcd (int a, int b){
if(b == 0) return a;
return gcd(b, a % b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int T, a, b;
scanf("%d",&T);
for(; T > 0; --T){
scanf("%d %d",&a,&b);
printf("%d\n",gcd(a,b));
}
return 0;
}