Cod sursa(job #2500722)
Utilizator | Data | 28 noiembrie 2019 16:11:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
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);
}
long n, a, b;
int main(){
fin >> n;
for(int i = 1; i <= n; i ++){
fin >>a >> b;
fout << gcd(a,b) << endl;
}
return 0;
}