Cod sursa(job #2306567)
Utilizator | Data | 22 decembrie 2018 16:04:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int gcd(int a,int b){
if(!b)return a;
return gcd(b,a%b);
}
int main(){
int n;
in >> n;
for(int i=0;i<n;i++){
int a,b;
in >> a >> b;
out << gcd(a,b) << endl;
}
}