Cod sursa(job #2066942)
Utilizator | Data | 15 noiembrie 2017 18:16:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int cmmdc(int a, int b)
{
if (b==0) return a;
return cmmdc(b, a%b);
}
int main()
{long T, a, b, i;
f>>T;
for (i=1; i<=T; i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<endl;
}
return 0;
}