Cod sursa(job #2727604)
Utilizator | Data | 22 martie 2021 10:17:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int x , int y)
{
if(y == 0)
return x;
else
{
return euclid(y , x % y);
}
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n;
in>>n;
for (int i = 0; i < n; ++i)
{
long int x, y;
in>>x>>y;
out<<euclid(x,y)<<'\n';
}
}