アルゴリズムC++ P.16 練習問題 1
#include <iostream> #include <algorithm> using namespace std; int gcd_new(int u, int v) { while(u > 0){ if(u < v) swap(u, v); u %= v; } return v; } int gcd_old(int u, int v) { int t; while(u > 0){ if(u < v) swap(u, v); u -= v; } return v; } int main() { int x, y; while(cin >> x && cin >> y){ if(x > 0 && y > 0){ cout<<"gcd of "<<x<<" and "<<y<<" is "<<gcd_old(x, y)<<"("<<gcd_new(x, y)<<")"<<endl; } } return 0; }