题目背景
本题为提交答案题,您可以写程序或手算在本机上算出答案后,直接提交答案文本,也可提交答案生成程序。
题目描述
将1,2,⋯,9共9个数分成3组,分别组成3个三位数,且使这3个三位数构成1:2:3的比例,试求出所有满足条件的3个三位数。
代码
暴力九重循环:
#include <stdio.h>
#include <cstdlib>
int main()
{
int i[9];
for (i[0] = 1; i[0] <= 9; i[0]++)
{
for (i[1] = 1; i[1] <= 9; i[1]++)
{
int p1=0;
if (i[1] == i[0]) p1 = 1;
if (p1 != 1) {
for (i[2] = 1; i[2] <= 9; i[2]++)
{
int p2=0;
for (int j2 = 0; j2 < 2; j2++) if (i[2] == i[j2]) p2 = 2;
if (p2 != 2) {
for (i[3] = 1; i[3] <= 9; i[3]++)
{
int p3=0;
for (int j3 = 0; j3 < 3; j3++) if (i[3] == i[j3]) p3 = 3;
if (p3 != 3) {
for (i[4] = 1; i[4] <= 9; i[4]++)
{
int p4=0;
for (int j4 = 0; j4 < 4; j4++) if (i[4] == i[j4]) p4 = 4;
if (p4 != 4) {
for (i[5] = 1; i[5] <= 9; i[5]++)
{
int p5=0;
for (int j5 =