Cod sursa(job #2376679)
Utilizator | Data | 8 martie 2019 17:04:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
//#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("date2.in");
ofstream g("date2.out");
int t;
int euclid(int a, int b)
{
if(a*b==0)
return max(a,b);
else return euclid(min(a,b),max(a,b)%min(a,b));
}
int main()
{
f>>t;
for(int i=1;i<=t;i++)
{
int a,b;
f>>a>>b;
g<<euclid(a,b)<<"\n";
}
return 0;
}