Cod sursa(job #2233784)
Utilizator | Data | 24 august 2018 14:24:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int, int);
int main() {
int t;
fin >> t;
while (t--) {
int a, b;
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
return 0;
}
int gcd(int a, int b) {
return (a == 0) ? b : gcd(b % a, a);
}