Cod sursa(job #2876421)
Utilizator | Data | 23 martie 2022 11:32:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
long T, a, b;
ifstream in(“euclid2.in”);
ofstream out(“euclid2.out”);
int GCD(long A, long B)
{
if(!B)
return A;
return GCD(B, A%B)
}
int main()
{
in>>T;
for(long i =1; i <= T; i++)
{
in>>a>>b;
out<<GCD(a,b);
}
return 0;
}