就是输入四个字，然后过程写出来的那种。
输入：6 6 6 6
输出：
6+6=12
12+6=18
18+6=24.
谢了！

began
readln(a,b,c,d);
x:=a+b;
writeln(a,'+',b,'=',x);
y:=x+c;
wrireln(x,'+',c,'=',y);
x:=y+d;
writeln(y,'+',d,'=',x);
readln;
end.

搜索就行了，顺便楼上好叼

3楼的厉害了

666666
3楼

万能公式，四个求导相加阶乘

type arr=array [1..4] of integer;
var i,result,n,len:integer;
d:arr;
r:array [1..3,1..4] of integer;
procedure print;
var i,j:integer;
begin
for i:=1 to 3 do
begin
for j:=1 to 3 do
if j<>2 then write(r[i,j])
else case r[i,j] of
1:write('+');
2:write('-');
3:write('*');
4:write('/');
end;
writeln('=',r[i,4]);
end;
end;
procedure try(k:integer;var d:arr);
var a,b,i,j,l,t:integer;
e:arr;
begin if k=1 then
if d[1]=24 then
begin
print;
readln(n);
halt;
end
else
else
begin
for i:=1 to k-1do
for j:=i+1 to k do
begin
a:=d[i];
b:=d[j];
if a<b then begin t:=a;a:=b;b:=t;end;
t:=0;
for l:=1 to k do
if (l<>i) and (l<>j) then
begin t:=t+1;e[t]:=d[l] end;
r[5-k,1]:=a;
r[5-k,3]:=b;
r[5-k,4]:=-1;
for l:=1 to 4 do
begin case l of
1:r[5-k,4]:=a+b;
2:r[5-k,4]:=a-b;
3:r[5-k,4]:=a*b;
4:if b<>0 then if a mod b=0 then r[5-k,4]:=a div b;
end;
r[5-k,2]:=l;
if r[5-k,4]<>-1
then
begin
e[t+1]:=r[5-k,4];
try(k-1,e)
end
end
end
end;
end;
begin
for i:=1 to 4 do read(d[i]);
readln;
try(4,d);
writeln('No answer!');
readln(n);
end.