Cod sursa(job #2411967)
Utilizator | Data | 21 aprilie 2019 14:56:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
int rest;
while(b)
{
rest = a % b;
a = b;
b = rest;
}
return a;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T, a, b;
in >> T;
for(int i = 1; i <= T; i++)
{
in >> a >> b;
out << cmmdc(a, b) << endl;
}
in.close();
out.close();
return 0;
}