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