12345
X 1
----------
55555
算法实现:#include<stdio.h>
#include<conio.h>int main(){
int i1,i2,i3,i4,i5;
long multi,result;
for(i1=1;i1<=9;i1++){
for(i2=0;i2<=9;i2++){
for(i3=0;i3<=9;i3++){
for(i4=0;i4<=9;i4++){
for(i5=0;i5<=9;i5++){
multi=i1*10000+i2*1000+i3*100+i4*10+i5*1;
result=i5*100000+i5*10000+i5*1000+i5*100+i5*10+i5;
if( multi*i1==result){
printf("\n%5d%2d%2d%2d%2d\n",i1,i2,i3,i4,i5);
printf("*%12d\n",i1);
printf("______\n");
printf("%3d%2d%2d%2d%2d\n",i5,i5,i5,i5,i5);
}
}
}
}
}
getch();
return 0;
}
}
代码实现过程中由于getch()报红,根据点击打开链接了解到getch()这个函数必须加上#include<conio.h> 头文件引用,
遇到Cannot find or open the PDB file这个问题,引用点击打开链接解决了这个问题,感激不尽。