Cod sursa(job #2446751)
Utilizator | Data | 10 august 2019 17:18:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int cgd(int a, int b)
{
if (!b) return a;
return cgd(b, a % b);
}
int main()
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int a, b, n;
f>>n;
for(n;n;--n)
{
f>>a>>b;
g<<cgd(a,b)<<'\n';
}
}