[算法设计与分析]4.2.2蛮力法案例(三个数的最小公倍数+狱吏问题三种解法)

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

using namespace std;

void ThreeLCM();
void ReleasePrisoner1();
void ReleasePrisoner2();
void ReleasePrisoner3();

int main ()
{
    ThreeLCM();
    ReleasePrisoner1();
    ReleasePrisoner2();
    ReleasePrisoner3();
}

void ThreeLCM()
{
    int x1, x2, x3, i;
    x1 = 2;
    x2 = 5;
    x3 = 4;
    i = 1;

    while(1)
    {
        if(i % x1 == 0 && i % x2 == 0 && i % x3 == 0)
            break;
        i++;
    }
    cout << "result : " << i << endl;
}


void ReleasePrisoner1()
{
    int n = 4;//n是牢房数也是循环开锁数
    int a[n + 1];//用数组a代表牢房的状态，=1代表上锁
    for(int i = 0; i <= n; i++)
    {
        a[i] = 1;//对全部牢房进行初始化
    }
    //外层循环控制进行的次数 内层循环控制每次循环进行的具体操作
    for(int i = 1; i <= n; i++)//总共进行n次
    {
        for(int j = i; j <= n; j += i