Cod sursa(job #2466219)
Utilizator | Data | 1 octombrie 2019 19:10:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b){
while (b!=0){
a%=b;
swap(a,b);
}
return a;
}
int main() {
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int t;
in>>t;
while (t){
int a,b;
in>>a>>b;
out<<gcd(a,b)<<'\n';
--t;
}
return 0;
}