博弈论
文章平均质量分 71
Grit_ICPC
Dielts
展开
-
SDUT2015暑假集训14级周赛1 E - 尤文图斯(NP-博弈)
E - 尤文图斯Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2147DescriptionRecently kiki has nothing to do. While she is bored,原创 2015-08-01 17:24:31 · 670 阅读 · 0 评论 -
A Multiplication Game HDOJ (巴什)
A Multiplication GameTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4369 Accepted Submission(s): 2480Problem DescriptionStan and原创 2015-08-02 20:15:29 · 367 阅读 · 0 评论 -
Public Sale HDOJ
Public SaleTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5742 Accepted Submission(s): 3354Problem Description虽然不想,但是现实总归是现实,Lel原创 2015-08-02 15:43:29 · 467 阅读 · 0 评论 -
Good Luck in CET-4 Everybody! HDOJ(巴什博弈)
Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6730 Accepted Submission(s): 4322Problem Description原创 2015-08-02 16:46:32 · 488 阅读 · 0 评论 -
迷之博弈 SDUT(链式)
迷之博弈Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述FF喜欢博弈,今天又开始了一场博弈。将n个棋子摆成一条直线,编号为1到n。两个人轮流取棋子,每回合取一次且只能按照下述两种方法的一种取。1,任取一个棋子。2,任取两个棋子且这两个棋子的编号是连续的。FF为了彰显高手风范总是让对方先原创 2015-08-03 10:29:50 · 444 阅读 · 0 评论 -
Being a Good Boy in Spring Festival HDOJ (尼姆博弈)
Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5604 Accepted Submission(s): 3343Problem Descrip原创 2015-08-02 19:28:19 · 464 阅读 · 0 评论 -
Game! SDUT(环形博弈)
Game!Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述One day, zbybr is playing a game with blankcqk, here are the rules of the game:There is a circle of N stones, zbybr and bl原创 2015-08-03 10:07:14 · 750 阅读 · 0 评论 -
南京理工大学第八届程序设计大赛(校外镜像) H谁才是最强战舰!(博弈)
大意:有n堆石子两人轮流取,每次取任意个,谁最后取走谁输。思路:1、当这么多堆都是一个石子那么,n为奇,那么先手为奇异状态,否则,为必胜。 2、否则对所有石子取亦或,若结果为0则先手奇异状态。#include<map>#include<queue>#include<cmath>#include<cstdio>#include<stack>#include<iostream>#inclu原创 2016-04-18 17:23:52 · 1123 阅读 · 0 评论