普及组的...我大概学了两个月...用节假日...没多少时间...不要笑我哦...算树的...长度L的马路种满了树(类似数轴的点),现在要开辟M个区域,区域内的树全部砍伐,区域起始和终止点要求可以控制(由人输入)...求剩下多少树...普及组的题目...我老觉得不会错...不知道为什么总不会运行成功...大家帮帮忙吧...program tree(input,output);typeaa=1..10000;bb=1..100;varL:aa;M:bb;x:array[1..10000] of integer;a,b:array[1..100] of aa;y,z:integer;tr,tre:text;beginassign(tr,tree.in);assign(tre,tree.out);rewrite(tr);rewrite(tre);readln(L,M);writeln(tr,L,M);for y:=1 to M do begin readln(a[y],b[y]); writeln(tr,a[y],b[y]); end;close(tr);for y:=1 to M do for z:=a[y] to b[y] do x[z]:=1;z:=0;for y:=1 to L do while x[y]=0 do z:=z+1;writeln(z);write(tre,z);close(tre);end.

你一直从键盘读入然後把tree.in覆写干什麼?program tree(input,output);type aa=1..10000; bb=1..100;var L:aa; M:bb; x:array[aa] of integer; a,b:array[bb] of aa; y,z:integer;begin assign(input,tree.in); assign(output,tree.out); reset(input); rewrite(output); readln(L,M); for y:=1 to M do readln(a[y],b[y]); for y:=1 to M do for z:=a[y] to b[y] do x[z]:=1; z:=0; for y:=1 to L do while x[y]=0 do z:=z+1; writeln(z); close(input); close(output);end.

真的吗?试试哦...先谢谢你了...