Cod sursa(job #2419230)
Utilizator | Data | 7 mai 2019 20:45:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, x, y;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(){
fin >> n;
for(int i = 1; i <= n; i++){
fin >> x >> y;
fout << gcd(x, y) << endl;
}
return 0;
}