Cod sursa(job #2257971)
Utilizator | Data | 10 octombrie 2018 18:15:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
std::ifstream InFile("euclid2.in");
std::ofstream OutFile("euclid2.out");
int Q;
int GCD(int a, int b) {
if(!b) return a;
return GCD(b, a%b);
}
void Citire() {
InFile >> Q;
}
void Rezolvare() {
int a, b;
while(Q--)
InFile >> a >> b,
OutFile << GCD(a, b) << '\n';
}
int main()
{
Citire();
Rezolvare();
return 0;
}