翻译为pascal语言CLSINPUT D$F$ = "D:\T\T4\" + D$ + ".IN"OPEN F$ FOR INPUT AS #1INPUT #1, NDIM A$(N)FOR I = 1 TO N INPUT #1, A$(I)NEXT IFOR I = 1 TO N - 1 FOR J = I + 1 TO N IF A$(I) + A$(J) < A$(J) + A$(I) THEN SWAP A$(I), A$(J) NEXT JNEXT
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/02 19:41:39
![翻译为pascal语言CLSINPUT D$F$ =](/uploads/image/z/12049875-27-5.jpg?t=%E7%BF%BB%E8%AF%91%E4%B8%BApascal%E8%AF%AD%E8%A8%80CLSINPUT+D%24F%24+%3D+%22D%3A%5CT%5CT4%5C%22+%2B+D%24+%2B+%22.IN%22OPEN+F%24+FOR+INPUT+AS+%231INPUT+%231%2C+NDIM+A%24%28N%29FOR+I+%3D+1+TO+N++INPUT+%231%2C+A%24%28I%29NEXT+IFOR+I+%3D+1+TO+N+-+1++FOR+J+%3D+I+%2B+1+TO+N++++IF+A%24%28I%29+%2B+A%24%28J%29+%3C+A%24%28J%29+%2B+A%24%28I%29+THEN+SWAP+A%24%28I%29%2C+A%24%28J%29++NEXT+JNEXT)
翻译为pascal语言CLSINPUT D$F$ = "D:\T\T4\" + D$ + ".IN"OPEN F$ FOR INPUT AS #1INPUT #1, NDIM A$(N)FOR I = 1 TO N INPUT #1, A$(I)NEXT IFOR I = 1 TO N - 1 FOR J = I + 1 TO N IF A$(I) + A$(J) < A$(J) + A$(I) THEN SWAP A$(I), A$(J) NEXT JNEXT
翻译为pascal语言
CLS
INPUT D$
F$ = "D:\T\T4\" + D$ + ".IN"
OPEN F$ FOR INPUT AS #1
INPUT #1, N
DIM A$(N)
FOR I = 1 TO N
INPUT #1, A$(I)
NEXT I
FOR I = 1 TO N - 1
FOR J = I + 1 TO N
IF A$(I) + A$(J) < A$(J) + A$(I) THEN SWAP A$(I), A$(J)
NEXT J
NEXT I
FOR I = 1 TO N
PRINT A$(I);
NEXT I
END
快点啊.
或者用pascal做这道题目
【问题描述】
设有n个整数(3≤n≤10),将这些整数拼接起来,可以形成一个最大的整数.
例如 n=3, 三个整数分别为21, 7, 34, 拼接后最大的整数为: 73421
【输 入】:文件读入.第一行一个整数n ,表示有n 个整数
第二行n个整数,数与数之间用一个逗号分隔.
【输 出】:输出到屏幕 .一个拼接后的最大的整数.
【样 例】:
输入 输出
3 73421
21,7,34
快点啊20分钟追加啊
翻译为pascal语言CLSINPUT D$F$ = "D:\T\T4\" + D$ + ".IN"OPEN F$ FOR INPUT AS #1INPUT #1, NDIM A$(N)FOR I = 1 TO N INPUT #1, A$(I)NEXT IFOR I = 1 TO N - 1 FOR J = I + 1 TO N IF A$(I) + A$(J) < A$(J) + A$(I) THEN SWAP A$(I), A$(J) NEXT JNEXT
program connect;
var
s:array[1..10]of string;
ss:string;
n,i,j:longint;
begin
readln(ss);
assign(input,ss+'.in');
reset(input);
readln(n);
readln(ss);
i:=1;
j:=0;
while j