Cod sursa(job #894408)
Utilizator | Data | 26 februarie 2013 21:09:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <cstdio>
using namespace std;
int t;
int a,b;
int gcd(int a, int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
void citire()
{
freopen("euclid2.in","r",stdin);
scanf("%d",&t);
freopen("euclid2.out","w",stdout);
for(int i=1;i<=t;++i)
{
scanf("%d%d",&a,&b);
printf("%d\n",gcd(a,b));
}
}
int main()
{
citire();
return 0;
}