您所在位置：主题：尼科彻斯问题
tanhaiwang
[专家分：0] 发布于 2006-05-10 19:31:00
program nkcs;
var
i,j:integer;
n,t:longint;
begin
j:=3;
readln(n);
writeln(n,'*,n,'*',n,'=',(n-1)*n+1);
for i:=1 to n-1 do
begin
t:=(n-1)*n+j;
j:=j+2;
write('+',t);
end;
end.
var
i,j:integer;
n,t:longint;
begin
j:=3;
readln(n);
writeln(n,'*,n,'*',n,'=',(n-1)*n+1);
for i:=1 to n-1 do
begin
t:=(n-1)*n+j;
j:=j+2;
write('+',t);
end;
end.