Cod sursa(job #2863458)
Utilizator | Data | 6 martie 2022 19:08:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main()
{
long long a, b ,n;
f >> n;
for (int i = 0; i < n; ++i) {
f >> a >> b;
g << gcd(a,b)<<"\n";
}
return 0;
}