Cod sursa(job #1076440)
Utilizator | Data | 10 ianuarie 2014 10:38:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int euclid(int x,int y)
{
if(!y) return x;
else
{
return euclid(y,x%y);
}
}
int main()
{
int a,b,n;
in>>n;
for(int i=1;i<=n;i++)
{
in>>a>>b;
out<<euclid(a,b)<<'\n';
}
}