Cod sursa(job #627378)
| Utilizator | Data | 29 octombrie 2011 18:30:29 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
int t,a,b;
int cmmdc(int a,int b)
{
int c=a%b;
while(c)
{
a=b;
b=c;
c=a%b;
}
return b;
}
int main()
{
freopen("euclid2.in","rw",stdin);
freopen("euclid2.out","wt",stdout);
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
scanf("%d %d",&a,&b);
if(a>b)
printf("%d\n",cmmdc(a,b));
else printf("%d\n",cmmdc(b,a));
}
return 0;
}
