Cod sursa(job #2066935)
Utilizator | Data | 15 noiembrie 2017 18:09:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
long cmmdc (long a, long b)
{
long c;
while (b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
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;
}