Cod sursa(job #3198211)
Utilizator | Data | 28 ianuarie 2024 15:08:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a,int b) {
if (!b) return a;
return gcd(b,a%b);
}
int main() {
int t,a,b;
fin>>t;
for (int i = 1;i<=t;++i) {
fin>>a>>b;
fout<<gcd(a,b)<<'\n';
}
return 0;
}