Cod sursa(job #2674766)
Utilizator | Data | 20 noiembrie 2020 09:29:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
int T, A, B;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
f>>T;
for (; T; --T)
{
f>>A>>b;
g<< gcd(A, B)<<'\n';
}
return 0;
}