Cod sursa(job #2266661)
Utilizator | Data | 22 octombrie 2018 20:21:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
int main()
{
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int a,b,T;
fin>>T;
for(int i=1;i<=T;i++){
fin>>a>>b;
fout<<gcd(a,b)<<'\n';
}
return 0;
}