Cod sursa(job #2060183)
Utilizator | Data | 7 noiembrie 2017 22:25:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream cin ("euclid2.in");
ofstream cout ("euclid2.out");
int n,a,b;
int gdc(int a, int b)
{
if(!b)
return a;
return gdc(b,a%b);
}
int main()
{
cin>>n;
for(; n; --n)
{
cin>>a>>b;
cout<<gdc(a,b)<<'\n';
}
return 0;
}