Cod sursa(job #2213265)
Utilizator | Data | 15 iunie 2018 23:03:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a, int b)
{
while (a != b)
{
if (a>b)
a = a-b;
else
b=b-a;
}
return a;
}
int main()
{
int nr_lines;
int a, b;
f>>nr_lines;
while (nr_lines--)
{
f>>a>>b;
g<<euclid(a, b)<<"\n";
}
return (0);
}