Cod sursa(job #2659818)
Utilizator | Data | 17 octombrie 2020 15:12:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int gcd(int nA, int nB)
{
if(!nB) return nA;
return gcd(nB, nA % nB);
}
int main()
{
int nA, nB, nT;
in >> nT;
while(nT)
{
in >> nA >> nB;
out << gcd(nA, nB) << '\n';
nT--;
}
return 0;
}