- Kerry 的电缆网络
-
风卷雨袭 LV 6 @ 2009-10-25 02:55:43
在自己电脑上没有编译错误，到这里一评测就除了编译错误。
——————————————————————————————————————————————————————————————
Fatal: Syntax error, "BEGIN" expected but "ordinal const" found Fatal: Compilation aborted
——————————————————————————————————————————————————————-———————
这个编译错误看的不是太懂，什么是ordinal const啊？
下面是我的程序。
————————————————————————————————————————————————————————————
program ex1; type mat2=record dist:real; p,q:longint; end; var s,answer:real; n,i,j:longint; set0:array [1..100000,0..100000]of longint; set1:array [1..100000]of longint; set2:array [1..100000]of mat2; answerx:boolean;
procedure init; begin readln(s); readln(n); i:=0; while not(EOF) do begin inc(i); readln(set2[i].p,set2[i].q,set2[i].dist); end; for j:=1 to n do begin set1[j]:=j; set0[j,0]:=1; set0[j,1]:=j; end; end;
procedure qsort1(p,q:longint); var i,j,px,qx:longint; distx:real; begin i:=p; j:=q; px:=set2[i].p; qx:=set2[i].q; distx:=set2[i].dist; while i
6 条评论
-
风卷雨袭 LV 6 @ 2009-10-28 13:00:17
我确实是用firefox提交的，但是为什么会出现这种乱码啊？firefox不允许不这种东西么？
-
@ 2009-10-25 08:40:32
Firefox的问题很严重咯
-
@ 2009-10-25 08:15:06
估计他是用火狐提交的……
-
@ 2009-10-25 08:13:21
浏览器问题？？？
-
@ 2009-10-25 03:02:25
怎么是乱码
program ex1; type mat2=record dist:real; p,q:longint; end; var s,answer:real; n,i,j:longint; set0:array [1..100000,0..100000]of longint; set1:array [1..100000]of longint; set2:array [1..100000]of mat2; answerx:boolean; procedure init; begin readln(s); readln(n); i:=0; while not(EOF) do begin inc(i); readln(set2[i].p,set2[i].q,set2[i].dist); end; for j:=1 to n do begin set1[j]:=j; set0[j,0]:=1; set0[j,1]:=j; end; end; procedure qsort(p,q:longint); var i,j,px,qx:longint; distx:real; begin i:=p; j:=q; px:=set2[i].p; qx:=set2[i].q; distx:=set2[i].dist; while i
-
@ 2009-10-25 02:59:21
program ex1; type mat2=record dist:real; p,q:longint; end; var s,answer:real; n,i,j:longint; set0:array [1..100000,0..100000]of longint; set1:array [1..100000]of longint; set2:array [1..100000]of mat2; answerx:boolean; procedure init; begin readln(s); readln(n); i:=0; while not(EOF) do begin inc(i); readln(set2[i].p,set2[i].q,set2[i].dist); end; for j:=1 to n do begin set1[j]:=j; set0[j,0]:=1; set0[j,1]:=j; end; end; procedure qsort(p,q:longint); var i,j,px,qx:longint; distx:real; begin i:=p; j:=q; px:=set2[i].p; qx:=set2[i].q; distx:=set2[i].dist; while i
- 1
信息
- ID
- 1045
- 难度
- 7
- 分类
- 树结构 点击显示
- 标签
- (无)
- 递交数
- 4932
- 已通过
- 1000
- 通过率
- 20%
- 被复制
- 10
- 上传者
-
Vivian Snow
