Cod sursa(job #1979484)
Utilizator | Data | 10 mai 2017 17:57:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#define input "euclid2.in"
#define output "euclid2.out"
using namespace std;
ifstream fin(input);
ofstream fout(output);
int div(int a,int b)
{
if(!b)return a;
else return div(b,a%b);
}
int main()
{
int t,a,b;
fin>>t;
for( ; t;--t)
{
fin>>a>>b;
fout<<div(a,b)<<'\n';
}
return 0;
}