Pagini recente » Cod sursa (job #3144927) | Cod sursa (job #2265897) | Cod sursa (job #1545870) | Cod sursa (job #699997) | Cod sursa (job #787050)
Cod sursa(job #787050)
#include<cstdio>
#include<assert.h>
using namespace std;
class euclid{
private:
int cmmdc(int x, int y){
int z;
while(y){
z = x;
x = y;
y = z % y;
}
return x;
}
public:
void solve(){
assert(freopen("euclid2.in", "r", stdin));
assert(freopen("euclid2.out", "w", stdout));
int cases;
scanf("%d", &cases);
for(int i = 0; i < cases; ++i){
int num1, num2;
scanf("%d%d", &num1, &num2);
printf("%d\n", cmmdc(num1, num2));
}
}
} t;
int main(){
t.solve();
return 0;
}