Cod sursa(job #2314120)
Utilizator | Data | 7 ianuarie 2019 21:58:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#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 x;
int nr1, nr2;
fin>>x;
for(int i=1; i<=x; ++i){
fin>>nr1>>nr2;
fout<<GCD(nr1, nr2)<<endl;
}
return 0;
}