Cod sursa(job #1664188)
Utilizator | Data | 26 martie 2016 12:13:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int GCD(int A, int B)
{
if(!B)
return A;
return GCD(B, A%B);
}
int main ()
{
int n,a,b,i;
in>>n;
for (i=1;i<=n;i++)
{
in>>a>>b;
out<<GCD(a,b)<<endl;
}
return 0;}