Cod sursa(job #877506)
Utilizator | Data | 12 februarie 2013 21:53:52 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
long long int a,b,n;
int euclid(int a,int b)
{
if(!b) return a;
return euclid(b,a%b);
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>a>>b;
cout<<euclid(a,b)<<'\n';
}
}