Cod sursa(job #2103482)
Utilizator | Data | 10 ianuarie 2018 13:06:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if (!b) return a;
else return cmmdc(b,a%b);
}
int a,b,n;
int main ()
{
f>>n;
for (int i=1; i<=n; i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}