Cod sursa(job #1932486)
Utilizator | Data | 19 martie 2017 20:21:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
int gcd(int a, int b){
if (!b){
return a;
}
return gcd(b, a%b);
}
int main(){
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int a,b,n;
fin >> n;
for (int i = 1; i <= n; i++){
fin >> a >> b;
fout << gcd(a,b) << '\n';
}
fin.close();
fout.close();
return 0;
}