Cod sursa(job #1283823)
Utilizator | Data | 6 decembrie 2014 01:32:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
int a,b,n;
int gcd ( int a, int b)
{
if (a==0) return b;
return gcd(b%a,a);
}
int main()
{
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
cin>>n;
while(n--)
{
cin>>a>>b;
cout<<gcd(a,b)<<"\n";
}
return 0;
}