Cod sursa(job #2180604)
Utilizator | Data | 20 martie 2018 23:26:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
int r;
do{
r = a % b;
a = b;
b = r;
}
while (r != 0);
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
int a;
int b;
f >> n;
for(int i = 1; i <= n; i++)
{
f >> a >> b;
g << cmmdc(a, b) << endl;
}
f.close();
g.close();
return 0;
}