古堡算式C++代码

 #include<iostream>
using namespace std;
int change(int n){
 
 int q,p,sum(0),t(10000);
 p=n;
 while(p){
  q=p %10 ;
  sum=q*t+sum;
  p=p /10;
  t=t/10;
 }
return sum;
}
 bool judge(int n){
  int a[5];
  int p=n,q;
  for (int i=0;i<5;i++){
   q= p%10 ;
   a[i]=q;
   p=p/10;
  }
  if((a[0]!=a[1])&&(a[0]!=a[2])&&(a[0]!=a[3])&&(a[0]!=a[4])&&(a[1]!=a[2])&&(a[1]!=a[3])&&(a[1]!=a[4])&&(a[2]!=a[3])&&(a[2]!=a[4])&&(a[3]!=a[4]))return true;
  else return false;
 }
int main(){
 for(int i=10000 ;i<=99999;i++){
  if ((change(i)%i==0)&&(judge(i))) cout<<i<<endl;
 }
 return 0;