]]>re: HOJ 1797 -- Red and Black http://m.shnenglu.com/huhupao/archive/2008/11/20/66236.html#67399huhupaohuhupaoThu, 20 Nov 2008 10:00:00 GMThttp://m.shnenglu.com/huhupao/archive/2008/11/20/66236.html#67399榪欙紝鎴戞兂鐢╠fs鏉ョ潃
]]>re: HOJ 1797 -- Red and Black http://m.shnenglu.com/huhupao/archive/2008/11/20/66236.html#67398huhupaohuhupaoThu, 20 Nov 2008 09:59:00 GMThttp://m.shnenglu.com/huhupao/archive/2008/11/20/66236.html#67398@瓚呯駭鑿滈笩澶栧姞姘撮鐜?br>寰堝ソ鍛錛岃兘榪囧氨琛屼簡錛侊紒
]]>re: HOJ 1797 -- Red and Black http://m.shnenglu.com/huhupao/archive/2008/11/19/66236.html#67341KnightKnightWed, 19 Nov 2008 15:53:00 GMThttp://m.shnenglu.com/huhupao/archive/2008/11/19/66236.html#67341
]]>re: HOJ 1797 -- Red and Black http://m.shnenglu.com/huhupao/archive/2008/11/19/66236.html#67330瓚呯駭鑿滈笩澶栧姞姘撮鐜?/dc:creator>瓚呯駭鑿滈笩澶栧姞姘撮鐜?/author>Wed, 19 Nov 2008 14:16:00 GMThttp://m.shnenglu.com/huhupao/archive/2008/11/19/66236.html#67330#include<stdio.h>
#include<string.h>
bool flag[21][21];
int sta[21][21],n,m,sum;
int dir[4][2]={-1,0,1,0,0,-1,0,1};
void DFS(int a,int b)
{
int i,t,k;
for(i=0;i<4;i++)
{
t=a+dir[i][0];
k=b+dir[i][1];
if(t>0&&t<=n&&k>0&&k<=m&&!sta[t][k]&&flag[t][k])
{
sum++;
sta[t][k]=1;
DFS(t,k);
]]>re: HOJ 1797 -- Red and Black http://m.shnenglu.com/huhupao/archive/2008/11/19/66236.html#67329瓚呯駭鑿滈笩澶栧姞姘撮鐜?/dc:creator>瓚呯駭鑿滈笩澶栧姞姘撮鐜?/author>Wed, 19 Nov 2008 14:11:00 GMThttp://m.shnenglu.com/huhupao/archive/2008/11/19/66236.html#67329鎴戜滑瀛︽牎涓轟粈涔堜竴鐩村紑榪欎箞澶氭病鐢ㄧ殑璇懼憿
鐪嬪埌緗戠粶嫻佺殑鏃跺欙紝浼犳巿鐐圭粡楠屽晩
0rz....
]]>re: HOJ 1766 -- Dog & Gopher http://m.shnenglu.com/huhupao/archive/2008/11/17/67091.html#67146RockURockUMon, 17 Nov 2008 14:09:00 GMThttp://m.shnenglu.com/huhupao/archive/2008/11/17/67091.html#67146
]]>re: HOJ 1797 -- Red and Black http://m.shnenglu.com/huhupao/archive/2008/11/08/66236.html#66300huhupaohuhupaoSat, 08 Nov 2008 01:29:00 GMThttp://m.shnenglu.com/huhupao/archive/2008/11/08/66236.html#66300