Cod sursa(job #1043941)
Utilizator | Data | 29 noiembrie 2013 01:58:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
#include <iostream>
using namespace std;
int gcd(int a,int b)
{
if(b==0) return a;
while(b)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int T,a,b;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&a,&b);
cout<<gcd(a,b)<<'\n';
}
return 0;
}