博弈
NineFailure
这个作者很懒,什么都没留下…
展开
-
HDU1517 巴什博弈变形
博弈原创 2016-04-03 12:15:39 · 1901 阅读 · 0 评论 -
HDU - 5724(54/600)
Alice and Bob are playing a special chess game on an n × 20 chessboard. There are several chesses on the chessboard. They can move one chess in one turn. If there are no other chesses on the right adja原创 2017-07-21 18:55:15 · 314 阅读 · 0 评论 -
HDU - 1846(33/600)
是十分水的巴什博弈呢#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;int main(){ int T; cin >> T; while (T--) { int n, m; cin >> n >原创 2017-07-09 21:26:11 · 235 阅读 · 0 评论 -
HDU - 1564(32/600)
New Year is Coming! ailyanlu is very happy today! and he is playing a chessboard game with 8600. The size of the chessboard is n*n. A stone is placed in a corner square. They play alternatively wit原创 2017-07-09 20:13:25 · 260 阅读 · 0 评论 -
HDU - 1525(31/600)
Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provi原创 2017-07-09 11:06:07 · 223 阅读 · 0 评论 -
HDU - 2149(42/600)
虽然不想,但是现实总归是现实,Lele始终没有逃过退学的命运,因为他没有拿到奖学金。现在等待他的,就是像FarmJohn一样的农田生涯。 要种田得有田才行,Lele听说街上正在举行一场别开生面的拍卖会,拍卖的物品正好就是一块20亩的田地。于是,Lele带上他的全部积蓄,冲往拍卖会。 后来发现,整个拍卖会只有Lele和他的死对头Yueyue。 通过打听,Lele知道这场拍卖的规则是这样的:刚开始底价为原创 2017-07-16 14:13:07 · 270 阅读 · 0 评论 -
HDU - 3863(41/600)
这种题先手要是赢不了那顶多也是平局#include<bits/stdc++.h>using namespace std;#define int long long main(){ int T; int u=0; while(cin>>u) { if(u==-1)break; printf("I bet on Oregon Map原创 2017-07-16 13:19:14 · 352 阅读 · 0 评论 -
HDU - 3389(40/600)
Bob and Alice are playing a new game. There are n boxes which have been numbered from 1 to n. Each box is either empty or contains several cards. Bob and Alice move the cards in turn. In each turn the原创 2017-07-16 11:35:08 · 373 阅读 · 0 评论 -
HDU - 3032(39/600)
Nim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of ob原创 2017-07-16 09:46:22 · 556 阅读 · 0 评论 -
HDU - 2897(38/600)
当日遇到月,于是有了明。当我遇到了你,便成了侣。 那天,日月相会,我见到了你。而且,大地失去了光辉,你我是否成侣?这注定是个凄美的故事。(以上是废话) 小t和所有世俗的人们一样,期待那百年难遇的日食。驻足街头看天,看日月渐渐走近,小t的脖子那个酸呀(他坚持这个姿势已经有半个多小时啦)。他低下仰起的头,环顾四周。忽然发现身边竟站着位漂亮的mm。天渐渐暗下,这mm在这街头竟然如此耀眼,她是天使吗原创 2017-07-11 20:05:18 · 277 阅读 · 0 评论 -
HDU - 2516(37/600)
1堆石子有n个,两人轮流取.先取者第1次可以取任意多个,但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出”Second win”.先取者胜输出”First win”. Input 输入有多组.每组第1行是2<=n<2^31. n=0退出. Output 先取者负输出”Second win”. 先取者胜输出”First win”. 参看Sample O原创 2017-07-11 18:33:28 · 256 阅读 · 0 评论 -
lightoj 1020 水博弈
Alice and Bob are playing a game with marbles; you may have played this game in childhood. The game is playing by alternating turns. In each turn a player can take exactly one or two marbles.Both Alice原创 2016-09-29 10:52:52 · 313 阅读 · 0 评论 -
HDU5011 尼姆博奕模板水
昨天看完想起来时尼姆博弈… 但是差点忘了怎么求… 记一下 没事看看别忘了#include<iostream>#include<cmath>#include<algorithm>#include<cstdio>#include<queue>#include<stack>#include<string>#include<vector>using namespace std;int原创 2016-10-12 10:53:22 · 296 阅读 · 0 评论 -
HDU1527 纯威左夫博弈
威左夫博弈原创 2016-04-04 19:17:34 · 421 阅读 · 0 评论 -
HDU - 1847(34/600)
爆搜….没啥好说的#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<queue>using namespace std;int t[10] = { 1,2,4,8,16,32,64,128,256,512 };int dp[1001];void dfs(int gg){原创 2017-07-10 00:51:18 · 238 阅读 · 0 评论