Cod sursa(job #1377145)
Utilizator | Data | 5 martie 2015 20:22:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int x, int y)
{
if(!y)
return x;
return euclid(y, x%y);
}
int main()
{
int n,a,b;
f>>n;
for(int i = 1; i <= n; i++)
{
f>>a>>b;
g<<euclid(a,b)<<"\n";
}
return 0;
}