算法竞赛入门————竖式问题

sprintf(buf,"%d%d%d%d",abc,de,x,y,z);

#include<stdio.h>
#include<string.h>
int main(){
	int count=0;
	char s[20],buf[99];
	scanf("%s",s);
	for(int abc=111;abc<=999;abc++)
	for(int de=11;de<=99;de++){
		int x=abc*(de%10),y=abc*(de/10),z=abc+de;
		sprintf(buf,"%d%d%d%d",abc,de,x,y,z);
		int ok=1;
		for(int 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;
}

/*竖式问题*/
#include<bits/stdc++.h>
using namespace std;
char s[20];
bool f(int num)
{
	int len=strlen(s),i,tmp;
	while(num)
	{
		tmp=num%10;
		for(i=0;i<len;i++)
		{
			if(s[i]-'0'==tmp)
				break;
		}
		if(i==len)
			return false;	
		num=num/10;
	}
	return true;
} 
int main(){
	int count=0;
	scanf("%s",s);
	int abc,de,x,y,z;
	for(abc=111;abc<=999;abc++){
		for(de=11;de<=99;de++){
			x=abc*(de%10);y=abc*(de/10);z=abc*de;
			if(f(abc)&&f(de)&&f(x)&&f(y)&&f(z)){
				count++;
				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",count);
			}
		}
	}
	return 0;
}