48 条题解
-
0
阳光不锈 LV 8 @ 2009-01-24 19:02:11
看看传球游戏吧
-
0
lemon_TsyD LV 9 @ 2009-01-23 10:17:46
唯一AC的一道题啊。。。。。。。。
/*
/----|---|-0---|---|---|>
/| / |
/ | / |
3 8 1 9
/ \/ / |
/
11 / | /
| 7 10 5
|/ \/ /
\/> o >> n >> m;
--m;//数组从0开始索引，所以要减1
p[0][m] = 1;
for(;o>0;o--)//时间循环
{
for(i = 0;i < 12;i++)//十二条边循环
{
for(j = 0;j < n;j++)//每边上人循环
{
if(p[i][j] != 0)//如果有果子则分裂果子
{
if(j == 0)//起点
{
switch(i)
{
case 0: c1j2(3,0,8);break;
case 8: c1j2(3,0,8);break;
case 1: c1j2(0,1,9);break;
case 9: c1j2(0,1,9);break;
case 2: c1j2(1,2,10);break;
case 10: c1j2(1,2,10);break;
case 3: c1j2(2,3,11);break;
case 11: c1j2(2,3,11);break;
case 4: c2j1(8,4,7);break;
case 5: c2j1(4,5,9);break;
case 6: c2j1(5,6,10);break;
case 7: c2j1(6,7,10);break;
}
}
else if(j == n - 1)//终点 箭头
{
switch(i)
{
case 0: c1j2(0,1,9);break;
case 1: c1j2(1,2,10);break;
case 2: c1j2(2,3,11);break;
case 3: c1j2(3,0,8);break;
case 4: c2j1(4,5,9);break;
case 9: c2j1(4,5,9);break;
case 5: c2j1(5,6,10);break;
case 10: c2j1(5,6,10);break;
case 6: c2j1(6,7,10);break;
case 11: c2j1(6,7,10);break;
case 7: c2j1(8,4,7);break;
case 8: c2j1(8,4,7);break;
}
}
else//棱上，不在角上
{
s[i][j - 1] += p[i][j];
s[i][j + 1] += p[i][j];
}
}
}
}
//更新数据到p
for(i = 0;i < 12;i++)
for(j = 0;j < n;j++)
{
p[i][j] = s[i][j];
s[i][j] = 0;
}
}
cout -
0
tangdongjian LV 8 @ 2009-01-23 00:14:19
就是传球游戏的改版嘛,不过描述有点……
阳光不锈
LV 8
@ 2009-01-24 19:02:11
