问题描述
将1,2,…,9共9个数分成三组,分别组成三个三位数,且使这三个三位数构成1:2:3的⽐例,试求出所有满⾜条件的三个三位数。
例如:三个三位数192,384,576满⾜以上条件。
输⼊格式
⽆输⼊⽂件
输出格式
输出每⾏有三个数,为满⾜题设三位数。各⾏为满⾜要求的不同解。
转自柳神的解法:链接请点此处
分析:先确定第⼀个数字,然后判断这个数字的两倍数和三倍数是否满⾜条件~ ⽤book数组标记当前数字是否已经出现过~
#include <iostream>
using namespace std;
bool judge(int i, int j, int k) {
int book[10] = {0};
book[0] = 1;
if(i == j || j == k || i == k)
return false;
book[i] = 1, book[j] = 1, book[k] = 1;
int one = i * 100 + j * 10 + k;
int two = 2 * one;
int three = 3 * one;
if(two >= 666 || three >=987)
return false;
if(book[two/100] == 1)
return false;
else
book[two/100] = 1;
if(book[two%100/10] == 1)
return false;
else
book[two%100/10] = 1;
if(book[two%10] == 1)
return false;
else
book[two%10] = 1;
if(book[three/100] == 1)
return false;
else
book[three/100] = 1;
if(book[three%100/10] == 1)
return false;
else
book[three%100/10] = 1;
if(book[three%10] == 1)
return false;
else
return true;
}
int main() {
for(int i = 1; i <= 3; i++) {
for(int j = 1; j <= 9; j++) {
for(int k = 1; k <= 9; k++) {
if(judge(i, j, k) == true) {
int one = i * 100 + j * 10 + k;
cout << one << " " << one * 2 << " " << one * 3 << endl;
}
}
}
}
return 0;
}