Cod sursa(job #744500)
Utilizator | Cazacu Robert taigi100 | Data | 8 mai 2012 20:55:02 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
using namespace std;
int euclid ( int a , int b)
{
if(!b)
return a;
if(b>a)
return euclid ( b , a);
if(a>b)
return euclid ( b , a%b);
}
int main()
{
freopen ("euclid2.in" , "r" , stdin);
freopen ("euclid2.out" , "w" , stdout);
int n,a,b;
scanf( "%d", &n);
for ( int i = 1 ; i <= n ; i++ )
{
scanf("%d %d", &a, &b);
printf( "%d\n", euclid(a , b) );
}
}