#include <bits/stdc++.h>
using namespace std;
int main(){
int i,ok, abc,de,x,y,z,count=0;
char s[20], buf[99];
cin >>s;
for(abc=111; abc<1000; abc++){
for(de=11; de<100; de++){
x=abc*(de%10);
y=abc*(de/10);
z=abc*de;
sprintf(buf, "%d%d%d%d%d",abc,de,x,y,z);
ok = 1;
for(i=0;i<strlen(buf);i++){
if(strchr(s, buf[i]) == NULL) ok =0;
}
if(ok)
{
printf("<%d>\n", ++count);
printf("%5d\nX%4d\n-----\n%5d\n%4d\n-----\n%5d\n\n", abc,de,x,y,z);
}
}
}
printf("The number of solutions = %d\n", count);
return 0;
}
算法竞赛_竖式问题_C++
最新推荐文章于 2024-12-21 12:07:40 发布
