洛谷--三连击（解法二）

#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
	bool isr = true;
	int a[15];
	a[0] = 0;
	for(int i=123;i<=329;i++){
		int tem1=i*2,tem2=i*3;
		a[1] = i/100;
		a[2] = i/10%10;
		a[3] = i%10;
		a[4] = tem1/100;
		a[5] = tem1/10%10;
		a[6] = tem1%10;
		a[7] = tem2/100;
		a[8] = tem2/10%10;
		a[9] = tem2%10;
		sort(a,a+10);
		isr = true;
		for(int j=1;j<=9;j++){
			if(a[j] != j){
				isr = false;
				break;
			}
		}
		if(isr == true){
			cout<<i<<" "<<tem1<<" "<<tem2<<endl;
		}
	}
	return 0;
}

循环内对每个数拆解排序再进行判断。