Cod sursa(job #2648537)
Utilizator | Data | 11 septembrie 2020 13:08:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int gcd(int x, int y){
while(y){
int c = x % y;
x = y;
y = c;
}
return x;
}
int main(){
int n, x, y;
in >> n;
for(int i = 1; i<=n; i++){
in >> x >> y;
out << gcd(x, y) <<"\n";
}
}