Cod sursa(job #2707022)
Utilizator | Data | 16 februarie 2021 12:48:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("drept.in");
ofstream out("drept.out");
int gcd(int a, int b) {
if (b == 0)
out << a << endl;
else
gcd(b, a % b);
}
int main() {
int T;
in >> T;
for(int i =1;i<=T;i++)
{
int a,b;
in >> a >> b;
gcd(a,b);
}
return 0;
}