码迷,mamicode.com
首页 >  
搜索关键字:chess    ( 440个结果
[ACM] hdu 4405 Aeroplane chess (概率DP)
Aeroplane chess Problem Description Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice hav...
分类:其他好文   时间:2014-07-31 09:49:57    阅读次数:208
POJ 1915 Knight Moves
Knight Moves Description Background  Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?  The P...
分类:其他好文   时间:2014-07-26 17:23:32    阅读次数:590
HDU 1087 Super Jumping! Jumping! Jumping!
Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know...
分类:其他好文   时间:2014-07-24 17:28:16    阅读次数:241
TopCoder SRM 628 DIV 2
250-point problemProblem StatementJanusz is learning how to play chess. He is using the standard chessboard with 8 rows and 8 columns. Both the rows a...
分类:其他好文   时间:2014-07-22 23:21:17    阅读次数:348
POJ 1915: Knight Moves
Knight Moves Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 21362 Accepted: 9926 Description Background Mr Somurolov, fabulous chess-gamer indeed...
分类:其他好文   时间:2014-07-18 23:12:55    阅读次数:280
POJ 2996 & 2993 国际象棋布局 模拟
Description Your task is to read a picture of a chessboard position and print it in the chess notation. Input The input consists of an ASCII-art picture of a chessboard with chess pieces on positio...
分类:其他好文   时间:2014-07-18 11:03:28    阅读次数:305
UVA Don't Get Rooked
题目如下:  Don't Get Rooked  In chess, the rook is a piece that can move any number of squaresvertically or horizontally. In this problem we will consider smallchess boards (at most ...
分类:其他好文   时间:2014-07-16 10:16:07    阅读次数:254
D广搜
/* D - 广搜 基础 Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u Submit Status Description Background Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but...
分类:其他好文   时间:2014-07-13 13:51:23    阅读次数:223
HDU 4405 Aeroplane chess (概率DP求期望)
题意:有一个n个点的飞行棋,问从0点掷骰子(1~6)走到n点需要步数的期望 其中有m个跳跃a,b表示走到a点可以直接跳到b点。 dp[ i ]表示从i点走到n点的期望,在正常情况下i点可以到走到i+1,i+2,i+3,i+4,i+5,i+6 点且每个点的概率都为1/6 所以dp[i]=(dp[i+1]+dp[i+2]+dp[i+3]+dp[i+4]+dp[i+5]+d...
分类:其他好文   时间:2014-07-11 08:26:13    阅读次数:210
Little Bishops uva861
Little BishopsA bishop is a piece used in the game of chess which is played on a board of square grids. A bishop can only move diagonally from its cur...
分类:其他好文   时间:2014-07-09 23:05:17    阅读次数:252
440条   上一页 1 ... 39 40 41 42 43 44 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!