Cod sursa(job #854026)
Utilizator | Data | 12 ianuarie 2013 17:44:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<cstdio>
using namespace std;
int cmmdc(int a,int b)
{
while(a!=b)
if(a>b)
a=a-b;
else
if(a<b)
b=b-a;
return a;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int n,i,a,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&a,%b);
printf("%d",cmmdc(a,b));
}
return 0;
}