Cod sursa(job #2637963)
Utilizator | Data | 25 iulie 2020 22:47:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream intrare("euclid2.in");
ofstream iesire("euclid2.out");
int i, A, B, swapp;
intrare >> i;
while(i > 0){
intrare >> A >> B;
if(A < B){
swapp = A;
A = B;
B = swapp;
}
if(A % B == 0)
iesire << B;
else if(A % B != 0)
iesire << A % B;
iesire << "\n";
i--;
}
return 0;
}