c++ 求最大公约数&&最小公倍数

1、求两个数的最大公约数

#include "stdafx.h"
#include<stdio.h>
#include<iostream>

using namespace std;

int _tmain(int argc, _TCHAR* argv[])
{
	int num1,num2;
	int max,min;
	int temp;
	cout << "input two numbers: ";
	cin >> num1 >> num2;
	//max = (num1 > num2) ? num1 : num2;
	//min = (num1 < num2) ? num1 : num2;
	if (num1 < num2)
	{
		max = num2;
		min = num1;
	}
	else
	{
		max = num1;
		min = num2;
	}
	while (max%min != 0)
	{
		temp = max%min;
		max = min;
		min = temp;
	}
	cout << num1 << "  " << num2 << "最大公约数为：" << temp << endl;
	return 0;
}

2、求两个数的最小公倍数

#include "stdafx.h"
#include<stdio.h>
#include<iostream>

using namespace std;

int _tmain(int argc, _TCHAR* argv[])
{
	int num1,num2;
	int max,min;
	int temp;
	cout << "input two numbers: ";
	cin >> num1 >> num2;
	//max = (num1 > num2) ? num1 : num2;
	//min = (num1 < num2) ? num1 : num2;
	if (num1 < num2)
	{
		max = num2;
		min = num1;
	}
	else
	{
		max = num1;
		min = num2;
	}
	while (max%min != 0)
	{
		temp = max%min;
		max = min;
		min = temp;
	}

	//两数之积除以最大公约数即为他们的最小公倍数
	temp = num1*num2 / temp;
	cout << num1 << "  " << num2 << "最小公倍数为：" << temp << endl;
	return 0;
}