大模拟，极度猥琐~~

实际上,我对这种猥琐题没有抵抗能力.

第十九个

第15个..

编译通过...

├ 测试数据 01：答案正确... 0ms

├ 测试数据 02：答案正确... 0ms

├ 测试数据 03：答案正确... 0ms

├ 测试数据 04：答案正确... 0ms

├ 测试数据 05：答案正确... 0ms

├ 测试数据 06：答案正确... 0ms

├ 测试数据 07：答案正确... 0ms

├ 测试数据 08：答案正确... 0ms

├ 测试数据 09：答案正确... 0ms

├ 测试数据 10：答案正确... 0ms

---|---|---|---|---|---|---|---|-

Accepted 有效得分：100 有效耗时：0ms

var a,d:array[1..500,1..500] of integer;

i,j,k,xx,yy,m,n,x,y:integer;

ch:char;

procedure fill(x,y:integer);

var i,j:integer;

begin

d[x,y]:=43;

d[x,y+4]:=43;

d[x-3,y]:=43;

d[x-3,y+4]:=43;

d[x-2,y+6]:=43;

d[x-5,y+2]:=43;

d[x-5,y+6]:=43; {+}

for i:= 1 to 3 do

begin

d[x,y+i]:=45;

d[x-5,y+i+2]:=45;

d[x-3,y+i]:=45; {-}

end;

d[x-1,y]:=124;

d[x-2,y]:=124;

d[x-1,y+4]:=124;

d[x-2,y+4]:=124;

d[x-3,y+6]:=124;

d[x-4,y+6]:=124; {|}

d[x-1,y+5]:=47;

d[x-4,y+1]:=47;

d[x-4,y+5]:=47; {/}

for i:= 1 to 3 do

for j:= 1 to 2 do

begin

d[x-j,y+i]:=32;

d[x-4,y+1+i]:=32;

d[x-1-j,y+5]:=32;

end; { }

end;

procedure init;

var x,y:integer;

begin

readln(m,n);

for x:= 1 to m do

begin

for y:= 1 to n do

read(a[m-x+1,y]);

readln

end;

for x:= 1 to 500 do

for y:= 1 to 500 do

d[x,y]:=46;

end;

begin

init;

x:=500;

y:=0;

for i:= m downto 1 do

for j:= 1 to n do

for k:= 1 to a do

begin

xx:= 500 - ( i-1 ) * 2 - (k-1) * 3 ;

yy:= 1 + ( i-1 ) * 2 + ( j-1 ) * 4 ;

if yy + 6 > y then y:= yy + 6 ;

if xx - 5 < x then x:= xx - 5 ;

fill(xx,yy);

end;

for i:= x to 500 do

begin

for j:= 1 to y do

begin

ch:=chr(d);

write(ch);

end;

writeln

end;

readln

end.

在九江多呆了一夜..和赣县的几个小鬼一起住..没事就把他做了..

样例貌似有错（红色部分）

......+---|+---|+...+---|+

..+---|+ / /|../ /|

./ /|-+---|+ |.+---|+ |

+---|+ |/ /| +-| | +

| | +---|+ |/+---|+ |/|

| |/ /| +/ /|-+ |

+---|+---|+ |/+---|+ |/| +

| | | +-| | + |/.

| | |/ | |-| +..

+---|+---|+---|+---|+ |/...

| | | | | +....

| | | | |/.....

+---|+---|+---|+---|+......

编译通过...

├ 测试数据 01：答案正确... 0ms

├ 测试数据 02：答案正确... 0ms

├ 测试数据 03：答案正确... 0ms

├ 测试数据 04：答案正确... 0ms

├ 测试数据 05：答案正确... 0ms

├ 测试数据 06：答案正确... 0ms

├ 测试数据 07：答案正确... 0ms

├ 测试数据 08：答案正确... 0ms

├ 测试数据 09：答案正确... 0ms

├ 测试数据 10：答案正确... 0ms

---|---|---|---|---|---|---|---|-

Accepted 有效得分：100 有效耗时：0ms

为什么我同样的程序，一次running，一次AC

通过 　　14人

提交 　　14次

通过率 　　100%

难度 　　2

哇！难以置信！

So quick....

......

.....

U43水一发题解~
题解

编译成功

测试数据 #0: Accepted, time = 0 ms, mem = 1612 KiB, score = 10
测试数据 #1: Accepted, time = 0 ms, mem = 1616 KiB, score = 10
测试数据 #2: Accepted, time = 0 ms, mem = 1608 KiB, score = 10
测试数据 #3: Accepted, time = 0 ms, mem = 1612 KiB, score = 10
测试数据 #4: Accepted, time = 0 ms, mem = 1612 KiB, score = 10
测试数据 #5: Accepted, time = 0 ms, mem = 1612 KiB, score = 10
测试数据 #6: Accepted, time = 15 ms, mem = 1612 KiB, score = 10
测试数据 #7: Accepted, time = 0 ms, mem = 1612 KiB, score = 10
测试数据 #8: Accepted, time = 0 ms, mem = 1616 KiB, score = 10
测试数据 #9: Accepted, time = 0 ms, mem = 1612 KiB, score = 10
Accepted, time = 15 ms, mem = 1616 KiB, score = 100

AC的第100道

来吧，是时候水一发题解了!我为长者Hello, World!

#include<stdio.h>
int main(){
    printf("Hello, World!");
}

#include<cstdio>
int main(){
    printf("Hello, World!");
}

```pascal
Begin
  Writeln('Hello, World!');
End.

• 水 ###Pascal Code var ans,s,s1:array[1..603,1..603]of char; q:Array[1..603,1..603]of boolean; i,j,k,i1,j1,n,m,t,p,x,y,h,len,now,maxh:longint; a:Array[1..50,1..50]of byte; flag:boolean; function max(x,y:longint):longint; begin if x>y then exit(x) else exit(y); end; begin readln(m,n);for i:=1 to m do for j:=1 to n do read(a[i,j]); h:=0;len:=4*n+1;now:=0;maxh:=0;len:=n*4+1+m+m; for i:=1 to 603 do for j:=1 to 603 do ans[i,j]:='.'; for t:=m downto 1 do begin h:=0; for i1:=1 to 603 do for j1:=1 to 603 do s[i1,j1]:='.'; for i:=1 to n do for j:=1 to a[t,i] do begin y:=(j-1)*3+1;x:=(i-1)*4+1; s[x,y]:='+';s[x+4,y]:='+';s[x,y+3]:='+';s[x+4,y+3]:='+'; s[x,y+1]:='|';s[x,y+2]:='|'; s[x+4,y+1]:='|';s[x+4,y+2]:='|'; for i1:=x+1 to x+3 do begin s[i1,y]:='-';s[i1,y+3]:='-'; end; for i1:=x+1 to x+3 do for j1:=y+1 to y+2 do s[i1,j1]:=' '; if h<max(a[t,i],a[t+1,i]) then h:=max(a[t,i],a[t+1,i]); end; s1:=s; for i:=1 to n*4+1 do for j:=1 to h*3+1 do if (s1[i,j]<>'.') and (s[i+2,j+2]='.') then begin s[i+2,j+2]:=s1[i,j]; if (s[i,j]='+') and (s[i+2,j+2]='+') then s[i+1,j+1]:='/'; if (s[i,j]='+') and (s[i+2,j+2]='+') and (s[i+1,j+2]<>s[i,j+2]) then s[i+1,j+2]:=' '; if (s[i,j]='+') and (s[i+2,j+2]='+') and (s[i+2,j+1]<>s[i+2,j]) then s[i+2,j+1]:=' '; end; for i:=1 to n*4+3 do for j:=1 to h*3+3 do if ans[i+now,j+now]='.' then ans[i+now,j+now]:=s[i,j];inc(now,2); end; for i:=1 to 603 do begin flag:=false; for j:=1 to len do if ans[j,i]<>'.' then begin flag:=true; break; end; if not flag then begin maxh:=i-1;break;end; end; for i:=maxh downto 1 do begin for j:=1 to len do write(ans[j,i]); writeln; end; end.