Pagini recente » Cod sursa (job #2152732) | Borderou de evaluare (job #1628305) | Cod sursa (job #657280) | Cod sursa (job #838641) | Cod sursa (job #1263476)
#include<iostream>
#include<fstream>
using namespace std;
int divizor(int a, int b);
inline int bigger(int a, int b);
inline int smallest(int a, int b);
int main(){
int perechi,a,b;
ifstream input("euclid2.in");
ofstream output("euclid2.out");
input >> perechi;
for (int i = 1; i <= perechi; i++){
input >> a >> b;
output << bigger(a,b) - (bigger(a,b)%smallest(a,b)) << "\n";
}
input.close();
output.close();
return 0;
}
inline int bigger(int a, int b){
if (a > b){ return a; }
else{ return b; }
}
inline int smallest(int a, int b){
if (a > b){ return b; }
else{ return a; }
}