摘要: Description 设有n个城市,依次编号为0,1,2,……,n-1(nmaxlongint)and(a[k,j]maxlongint) then a[i,j]:=a[i,k]+a[k,j]; for i:=0 to n-1 do write(a[s... 阅读全文
posted @ 2017-04-06 16:21 银叶草 阅读(175) 评论(0) 推荐(0) 编辑
Live2D