穷举法嘛。
long n[10]
n[1]=1
....
n[10]=0
int a,b,c,d,e,f,g,h,i,j
for a=1 to 10
for b=1 to 10
if a=b continue
for c=1 to 10
if c=a or c=b continue
if n[a] + n[b] <> n[c] then continue
for d=1 to 10
if d=a or d=b or d=c then continue
for e=1 to 10
if e=a or e=b or e=c or e=d then continue
for f=1 to 10
if .....
for g=1 to 10
....
if n[g] * n[h] = n[i]*10+n[j] then
messagebox('结果',string(n[a]) + '+' +string(n[b])+'='+string(n[c])+'~r~n'+....)
return
end if
end if
next
next
next