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