Cod sursa(job #315807)
Utilizator | Data | 17 mai 2009 13:23:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
using namespace std;
int t;
long long a,b;
int cmmdc(long long a,long long b)
{
if(!b)return a;
return cmmdc(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&t);
for(int i=0;i<t;++i)
{
scanf("%lld %lld",&a,&b);
printf("%d",cmmdc(a,b));
}
return 0;
}