2017年02月_sslgzzzy

原创迷宫

var f:array[1..4,1..2]of longint; a:array[1..1000,1..1000]of longint; i,j,n,m,t,sx,sy,fx,fy,x,y,ans:longint;function check(x,y:longint):boolean; var i,j:longint; begin if (x>=1)and(x=1)

2017-02-22 15:45:02 320

原创单词方阵

var s:string; f:array[1..8,1..2]of longint; a:array[0..100] of string; b:array[1..100,1..100]of boolean; i,j,n,m,v,k,bb,x,y,ans:longint;function check(x,y,shu:longint):boolean; var i,j:l

2017-02-19 11:33:50 264

原创八皇后

var ans,i,j,n,k:longint; a:array[1..13]of longint; s:array[1..13]of boolean; d1:array[2..26]of boolean; d2:array[-12..12]of boolean; procedure dfs(j:longint); var i:longint; begin i

2017-02-19 11:32:55 284

原创排队接水

var a:array[0..1000,1..2]of longint; i,j,n,ans:longint; sum:int64;begin read(n); for i:=1 to n do begin read(a[i,1]); a[i,2]:=i; end; for i:=1 to n-1 do for j:=i+1 to n do

2017-02-19 11:31:54 223

原创 [USACO1.3]混合牛奶 Mixing Milk

var a:array[0..10000,1..2]of longint; i,j,n,ans,s:longint;begin readln(s,n); for i:=1 to n do read(a[i,1],a[i,2]); for i:=1 to n-1 do for j:=i+1 to n do if a[i,1]>a[j,1] then beg

2017-02-19 11:31:04 245

原创数列分段Section I

var a:array[1..100000]of longint; i,j,n,m,s,ans:longint;begin read(n,m); for i:=1 to n do read(a[i]); for i:=1 to n do if a[i]+s else begin s:=a[i];inc(ans);end; wri

2017-02-19 11:28:10 325

原创拼数

var a:array[1..20]of longint; s:array[1..20]of string; i,j,n:longint; t:string;begin read(n); for i:=1 to n do begin read(a[i]); str(a[i],s[i]); end; for i:=1 to n-1 do for

2017-02-19 11:27:02 183

原创潜伏者

var before:array['A'..'Z']of char; have:array['A'..'Z']of boolean; i,j,n:longint; s,ss,sss:string; ic,jc:char;begin readln(s); readln(ss); readln(sss); if sss='HELLO'then begin wri

2017-02-19 11:25:49 242

原创斯诺登的密码

var a:array[1..6]of string; s,ss,t:string; x:char; n,i,j,b:longint;begin while x begin read(x); s:=s+x; end; for i:=1 to 6 do begin b:=pos(' ',s); ss:=copy(s,1,b-1);

2017-02-19 11:24:30 328

原创奖学金

var a:array[0..300,1..5] of longint; i,j,n:longint;begin read(n); for i:=1 to n do begin a[i,1]:=i; read(a[i,2],a[i,3],a[i,4]); a[i,5]:=a[i,2]+a[i,3]+a[i,4]; end; for i:=1 to

2017-02-19 11:19:52 241

原创谁拿了最多奖学金

var s:string; east,gb:array[0..100]of boolean; nam:array[0..100]of string; sum:array[1..100]of longint; a:array[0..100,1..2]of longint; l:array[0..100]of longint; i,j,n,max,ans,b:longint

2017-02-19 11:17:02 243

原创宇宙总统

var a:array[1..20] of string; x:string; i,n,s:integer; begin readln(n); for i:=1 to n do readln(a[i]); s:=1; for i:=2 to n do if (length(a[i])>length(a[1]))or(length(

2017-02-19 11:16:18 221

原创明明的随机数

var a:array[1..10000]of longint; i,j,n,nn,t:longint;begin read(n); nn:=n; for i:=1 to n do read(a[i]); for i:=1 to n-1 do for j:=i+1 to n do begin if a[i]>a[j] then begin

2017-02-19 11:14:05 168

原创【模板】快速排序

vara:array[1..100000]of longint;i,n:longint;procedure qsort(l,r:longint);vari,j,mid,t:longint;begin i:=l; j:=r; mid:=a[(l+r) div 2]; repeat while a[i]

2017-02-19 10:28:40 163

原创字符串的展开

var p1,p2,p3,i,j,n,l:longint; ic,k:char; s,ss,s2:ansistring; function check(c,cc:char):boolean; var biao:longint; begin biao:=0; if ((c in['a'..'z'])and(cc in['a'..'z']))or((c in['0'

2017-02-19 10:27:49 336

原创花生采摘

var num,h,s:array[1..1000]of longint; i,j,n,t,m,k,sum,ans,x,y:longint;begin read(n,m,k); for i:=1 to n do for j:=1 to m do begin read(x); if x begin inc(sum); num[su

2017-02-19 10:04:56 213

原创乒乓球

var c:array[1..500001] of char; n,i,s1,s2:longint;begin repeat inc(n); read(c[n]); until c[n]='E'; for i:=1 to n do begin if c[i]='W' then inc(s1); if c[i]='L' then inc(s2

2017-02-19 10:04:01 254

原创均分纸牌

varn,i,s,j,ans:longint;a:array[0..1000] of longint;beginreadln(n);for i:=1 to n dobeginread(a[i]);s:=s+a[i];end;s:=s div n;for i:=1 to n do a[i]:=a[i]-s;i:=1;j:=n;while (a[

2017-02-19 10:02:51 291

原创笨小猴

var s:string; aa:array[1..26] of longint; i,j,maxn,minn,n:longint; i2:char;begin assign(input,''); assign(output,''); reset(input); rewrite(output); read(s); maxn:=-1;

2017-02-19 10:01:26 273

原创机器翻译

var a:array[0..1000]of boolean; nc:array[1..1000]of longint; x,m,n,i,j,b,ans,s:longint;begin read(m,n); for i:=1 to n do begin read(x); if (a[x])=false then begin inc(ans);

2017-02-19 10:00:14 392

原创多项式输出

var a:array[1..100]of longint; i,j,n,last:longint;begin readln(n); for i:=1 to n do read(a[i]); read(last); if (a[1]-1) then begin if a[1]>0 then write(a[1],'x^',n); if a[1] end;

2017-02-19 09:52:40 691

原创铺地毯

var a,b,g,k:array[1..10000]of longint; i,n,j,x,y:longint;begin read(n); for i:=1 to n do readln(a[i],b[i],g[i],k[i]); read(x,y); for i:=n downto 1do if (x>=a[i])and(y>=b[i])and(x

2017-02-19 09:45:42 203

sslgzzzy的博客