Cod sursa(job #2240806)
Utilizator | Data | 14 septembrie 2018 09:46:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int a, b, t;
int gcd(int a, int b){
if(!b)return a;
else return gcd(b,a%b);
}
int main()
{
in>>t;
for(; t; --t)
{
in>>a>>b;
out<<gcd(a,b)<<'\n';
}
return 0;
}