Cod sursa(job #2377630)
Utilizator | Data | 10 martie 2019 19:10:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int k;
int gcd(a, b){
if (!b)
return a;
else
return gcd(b, a mod b);
}
int main(){
fin>>k;
int a,b;
while(k){
fin>>a>>b;
fout<<gcd(a,b)<<"\n";
k--;
}
return 0;
}