直接暴力筛选就好

#include<iostream> 
#include<cstdio>
#include<cstdlib>
using namespace std;
int main()
{
     for(int i=123;i<329;i++) 
     {int p=2*i,q=3*i;
      if(
      (i%1000/100!=i%100/10)&&(i%100/10!=i%10/1)&&(i%1000/100!=i%10/1)&&
      (p%1000/100!=p%100/10)&&(p%100/10!=p%10/1)&&(p%1000/100!=p%10/1)&&
      (q%1000/100!=q%100/10)&&(q%100/10!=q%10/1)&&(q%1000/100!=q%10/1)&&                              //三个三位数各自数字不同 
      (i%1000/100!=p%1000/100)&&(i%1000/100!=p%100/10)&&(i%1000/100!=p%10/1)&&
      (i%100/10!=p%1000/100)&&(i%100/10!=p%100/10)&&(i%100/10!=p%10/1)&&
      (i%10/1!=p%1000/100)&&(i%10/1!=p%10/10)&&(i%10/1!=p%10/1)&&                                    //i的三位数与P的不同 
      (i%1000/100!=q%1000/100)&&(i%1000/100!=q%100/10)&&(i%1000/100!=q%10/1)&&
      (i%100/10!=q%1000/100)&&(i%100/10!=q%100/10)&&(i%100/10!=q%10/1)&&
      (i%10/1!=q%1000/100)&&(i%10/1!=q%10/10)&&(i%10/1!=q%10/1)&&                                    //i的三位数与q的不同 
      (p%1000/100!=q%1000/100)&&(p%1000/100!=q%100/10)&&(p%1000/100!=q%10/1)&&
      (p%100/10!=q%1000/100)&&(p%100/10!=q%100/10)&&(p%100/10!=q%10/1)&&
      (p%10/1!=q%1000/100)&&(p%10/1!=q%10/10)&&(p%10/1!=q%10/1)&&                                    //p的三位数与q的不同 
      (i%100/10!=0)&&(i%10/1!=0)&&(p%100/10!=0)&&(p%10/1!=0)&&(q%100/10!=0)&&(q%10/1!=0)             //个位十位不为0 

         {cout<<i<<" "<<p<<" "<<q<<" "<<endl;}
     }
     system("pause");
     return 0;
}