[算法竞赛入门]竖式问题

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>

using namespace std;

int main(){
    char input[20], buf[99];
    int abc, de, s1, s2, s;
    memset(input, 0x00, sizeof(input));

    while(cin >> input){
        int cnt = 0;
        for(int i = 111; i <= 999; i++){
            for(int j = 11; j <= 99; j++){
                abc = i;
                de = j;
                s1 = (de % 10) * abc;
                s2 = (de / 10) * abc;
                s = s1 + s2 * 10;
                sprintf(buf, "%d%d%d%d%d", abc, de, s1, s2, s);
                bool flag = true;
                for(int i = 0; i < strlen(buf); i++) {
                    if(NULL == strchr(input, buf[i])) {
                        flag = false;
                    }
                }
                if(true == flag){
                    cout << "<" << ++cnt << ">" << endl;
                    printf("%5d\nX%4d\n-----\n%5d\n%4d \n-----\n%5d\n", abc, de, s1, s2, s);
                }
            }
        }
        cout << "The number of solutions = " << cnt << endl;
    }
    return 0;
}