Cod sursa(job #2850581)
Utilizator | Data | 17 februarie 2022 01:19:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,a,b;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b){
if(b == 0){
return a;
}else{
return gcd(b, a%b);
}
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++){
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
return 0;
}