program matching; var ans,c,d,e,f,g,h,i,j,k,m,n:longint; map:array[1.. 1000,1.. 1000] of boolean; chk:array[1.. 1000] of boolean; mat

分组teams Time Limit:1000MS Memory Limit:65536K Total Submit:2 Accepted:0 Description 你的任务是把一些人分成两组，使得： •每个

http://www.wowmovies.cn/down_content.asp?id=24394 http://www.zhiyewanjia.com/article/2009/0825/article_20906.html

program kmp; var re,c,d,e,f,g,h,i,j,k:longint; s,t,r:string; next:array[1.. 10000] of longint; procedure getnext; var i,j,k:longint;

program p1426; var c,d,e,f,g,h,i,j,k,m,n:longint; a:array[1.. 5000000] of longint; vt:array[1.. 200,1.. 5] of longint; w:array[1.. 20

http://billylinux.blog.hexun.com/9900605_d.html

const max_n=100; max_l=10; var st:string; tot,ans:longint; art:array[0..max_n*max_l,1..26]of longint; hou,fa:array[0..max_n*max_l] o

program writing; var f:array[0..10,1..9,0..2000000]of byte; fu:array[0..10,1..9,0..2000000]of boolean; t:array[0..10,0..10]of longint;

program hkt; const bob=100000; var x,y:array[0..3000]of longint; h:array[0..3000]of extended; f:array[0..3000]of longint; n,m,tot,g,ans1,ans2:longint; procedure work; var c,i,j:longint; d,t:extended; begin c:=0; d:=0; for i:=1 to m do begin j:=i+1; if j>m then j:=1; t:=0; if y[i]=0 then begin if (x[i]<0)or(x[i]>bob) then continue; if y[j]=0 then continue; if y[j]<0 then inc(c) else c:=c+2; t:=x[i]; end else begin if y[j]=0 then begin if (x[j]<0)or(x[j]>bob) then continue; if y[i]<0 then inc(c) else c:=c+2; t:=x[

type gen=record x,y:extended; l1,l2:extended; k:boolean; end; const zero=10e-16; var mo:array[1..2,0..2003]of gen; desided:arr

/* WC2007_SC_HS 《炮兵阵营》——经典的状态压缩动态规划问题 */ #include #include #define maxn 300 int num[maxn],size; int map[maxn]

const max_n=10; var bf:array[1..max_n,1..2]of longint; k:array[1..max_n,1..max_n]of longint; ans,i,j,x,y:longint; n,min:longint; fun

//RP test var key,lc,rc,sum,aux:array[0..500000] of longint; count,x,len,tmp:longint; root,total,a,n,ta,tb:longint; procedure rotl(v

program p0190; var c,d,e,f,g,h,i,j,k,m,n,p:longint; map,map2:array[1.. 200,1.. 200] of boolean; chk:array[1.. 200] of boolean; sta:ar

program prim; var total,c,d,e,f,g,h,i,j,k,m,n:longint; cost:array[1.. 1000,1.. 1000] of longint; close,lowcost:array[1.. 1000] of longi

program award; var hmax,c,d,e,i,j,k,m,n,x,y:longint; a:array[1.. 200,1.. 200] of boolean; f,h:array[1.. 200,1.. 200] of longint; g2:a

program dijkstra; var min,work,c,d,e,f,g,h,i,j,k,m,n:longint; finish:boolean; know:array[1.. 500,1.. 500] of longint; zt:array[1.. 50

program p0145; var max,c,d,e,f,g,h,i,j,k,m,n:longint; a,b:array[0.. 10000] of longint; begin readln(n); a[0]:=0; max:=0; for i:=

begin readln(n); fillchar(map,sizeof(map),0); for i:=1 to n do begin readln(y1[i],x1[i],y2[i],x2[i],color[i]); for j:=y1[i] to y

200 1 6 1 5 1 1 2 5 5 3 1 6 1 5 1 6 1 2 1 5 1 3 4 1 1 6 4 5 1 3 1 6 5 6 2 5 5 6 1 5 1 4 1 6 6 2 1 5 6 1 2 3 3 4

program domino; var c,d,e,f,g,h,i,j,k,m,n,sum,max,min:longint; a,z:array[1.. 1000] of longint; b:array[-6000.. 6000] of boolean; when

program toulan; var c,d,e,i,j,k,m,n:longint; f,g,a,b:array[0.. 10000] of longint; procedure quicksort(p,q:longint); var i,j,k,x:longi

program p1031; var c,d,e,f,g,h,i,j,k,m,n,mx,my,cx,cy,md,cd:longint; a,b:array[1.. 10,1.. 10] of longint; hash:array[1.. 10,1.. 10,1.. 1

Problem 猫和老鼠在10*10的方格中运动，例如： *...*..... ......*... ...*...*.. .......... ...*.C.... *.....*... ...*...

program p1276; var first,last,v1,v2,v3,c,d,e,f,g,h,i,j,k,m,n:longint; a:array[0.. 100000,1.. 3] of longint; hash:array[-128.. 400,-128.