Cod sursa(job #2407030)
Utilizator | Data | 16 aprilie 2019 13:36:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ofstream out("euclid2.in");
int euclid(int x, int y)
{
return ( !y ? x : euclid(y, x % y));
}
void rezolvare()
{
ifstream in("euclid");
int n=0 ;
int x,y ;
in>>n;
for(int i = 0 ; i < n ; i++)
{
in>>x>>y;
out<<euclid(x,y)<<'\n';
}
}
int main()
{
rezolvare();
return 0;
}