[C/C++] Example / 최대공약수(GCM) 알고리즘

//
//  main.cpp
//
//  Created by gchoi on 2014. 5. 8..
//  Copyright (c) 2014년 gchoi. All rights reserved.
//

#include <iostream>
#include <fstream>
#include <strstream>

using namespace std;

int gcm(int x, int y);
void gcmprint(int x, int y);

int main(int argc, const char * argv[])
{
    gcmprint(10, 5);
    gcmprint(52, 16);
   
    return 0;
}

int gcm(int x, int y) {
    int z;
    while ((z = x % y) != 0) {
        x = y;
        y = z;
    }
   
    return y;
}

void gcmprint(int x, int y) {
    cout << gcm(x, y) << endl;
}