码迷,mamicode.com
首页 >  
搜索关键字:motion sensing game    ( 5950个结果
hdu1505--City Game(扫描线+坑啊 )
City Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4572    Accepted Submission(s): 1938 Problem Description Bob is a strategy...
分类:其他好文   时间:2014-08-11 12:05:12    阅读次数:327
A - City Game
#include#include#includeusing namespace std;#define N 1002int map[N][N];int main(){ int i,j,m,n,Min,area,high,t,k; char c[100]; scanf("%d",&t...
分类:其他好文   时间:2014-08-11 10:06:51    阅读次数:198
HDU-4924-Football Manager(DFS+DP)
Problem Description Football Manager is a series of football management simulation games developed by Sports Interactive and published by Sega. In this game, you will play a role of a football club m...
分类:其他好文   时间:2014-08-11 00:31:01    阅读次数:400
Treblecross 博弈SG值
Treblecross is a two player game where the goal is to get threeXin a row on a one-dimensional board. At the start of the game all cells in the board a...
分类:其他好文   时间:2014-08-10 23:50:01    阅读次数:451
ZOJ 3791 An easy game DP+组合数
给定两个01序列,每次操作可以任意改变其中的m个数字 0变 1 1 变 0,正好要变化k次,问有多少种变法dp模型为dp[i][j],表示进行到第i次变化,A,B序列有j个不同的 变法总和。循环k次,每次针对m,向那j个不同 分1-j个即可,不过要用到组合数,因为对每个数操作不同都不一样最后结果就是...
分类:其他好文   时间:2014-08-10 18:19:30    阅读次数:163
POJ3420 Quad Tiling (矩阵加速状压dp)
传送门:http://poj.org/problem?id=3420Quad TilingTime Limit: 1000MSMemory Limit: 65536KDescriptionTired of the Tri Tiling game finally, Michael turns to a...
分类:其他好文   时间:2014-08-10 15:20:20    阅读次数:290
uva 12033 - Game of CS(树形删边)
题目链接:uva 12033 - Game of CS 题目大意:给定图,以0为根节点,每条边有一个长度,两个人轮流操作,每次为一条边上色,上一个单位长度,当一条边的颜色被涂满,则算作是减掉整段子树。判断先手是否必胜。 解题思路:SG定理,对于当前节点u,每次考虑字节点v,u-v边的长度为l 当l为1时:sg(u) ^= (sg(v) + 1) 当l为奇数时: 需要判断sg(v...
分类:其他好文   时间:2014-08-10 01:50:49    阅读次数:258
UVA 489-- Hangman Judge--暴力串处理
Hangman Judge  In ``Hangman Judge,'' you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are t...
分类:其他好文   时间:2014-08-09 21:37:19    阅读次数:414
uva 1567 - A simple stone game(K倍动态减法游戏)
题目链接:uva 1567 - A simple stone game 题目大意:给定K和N,表示一堆石子有N个,先手第一次可以取1~N-1个石子,取到最后一个石子的人胜利,单词每次操作时,取的石子数不能超过对手上一次取的石子数m的K倍。问先手是否可以必胜,可以输出最小的首次操作。 解题思路:这题想了一天,又是打表找规律,又是推公式的,楞是做不出来,后来在网上找到了一篇题解,将的很清楚...
分类:其他好文   时间:2014-08-09 11:46:07    阅读次数:202
CF#260 C.Boredom
Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it. Given a sequence a consisting of n integ...
分类:其他好文   时间:2014-08-09 11:42:48    阅读次数:311
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!