Cod sursa(job #2216596)
Utilizator | Data | 27 iunie 2018 14:16:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
int cmmdc(int x,int y)
{
if(y==0) return x;
else return cmmdc(y,x%y);
}
void query(int T)
{
int x,y;
for(int i=0;i<T;i++)
{
fin>>x>>y;
fout<<cmmdc(x,y)<<'\n';
}
}
int main ()
{
int T;
fin>>T;
query(T);
return 0;
}