Cod sursa(job #2202515)
Utilizator | Asd asd llama27 | Data | 8 mai 2018 22:36:49 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int MyEuclid(int a, int b)
{
int r;
while (b)
{
r = a % b; a = b; b = r;
}
if (b > 1)
return a;
else
return 1;
}
int main()
{
int T, a, b;
for (int i = 0; i < T; i++)
{
in >> a >> b;
out << MyEuclid(a, b);
}
}