Codeforces 39E-What Has Dirichlet Got to Do with That?

12人阅读 评论(0) 收藏 举报
分类:

What Has Dirichlet Got to Do with That?
time limit per test
2 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

You all know the Dirichlet principle, the point of which is that if n boxes have no less than n + 1 items, that leads to the existence of a box in which there are at least two items.

Having heard of that principle, but having not mastered the technique of logical thinking, 8 year olds Stas and Masha invented a game. There are a different boxes and b different items, and each turn a player can either add a new box or a new item. The player, after whose turn the number of ways of putting b items into a boxes becomes no less then a certain given number n, loses. All the boxes and items are considered to be different. Boxes may remain empty.

Who loses if both players play optimally and Stas's turn is first?

Input

The only input line has three integers a, b, n (1 ≤ a ≤ 100001 ≤ b ≤ 302 ≤ n ≤ 109) — the initial number of the boxes, the number of the items and the number which constrains the number of ways, respectively. Guaranteed that the initial number of ways is strictly less than n.

Output

Output "Stas" if Masha wins. Output "Masha" if Stas wins. In case of a draw, output "Missing".

Examples
input
Copy
2 2 10
output
Copy
Masha
input
Copy
5 5 16808
output
Copy
Masha
input
Copy
3 1 4
output
Copy
Stas
input
Copy
1 4 10
output
Copy
Missing
Note

In the second example the initial number of ways is equal to 3125.

  • If Stas increases the number of boxes, he will lose, as Masha may increase the number of boxes once more during her turn. After that any Stas's move will lead to defeat.
  • But if Stas increases the number of items, then any Masha's move will be losing.

题意:一开始给定a个箱子,b个球和常数n (球和箱子都是各不相同的,不会出现有一样的物品),若把b个球放到a个箱子中的方案数大于n则游戏结束。有2个人玩游戏,若当前轮到一个人时,这个人可以选择增加一个箱子或增加一个球,若增加完后方案数大于n则这个人输。若先手必胜,则输出 Masha ,若先手必败则输出 Stas ,若为平局则输出 Missing。

解题思路:暴力搜索。若当前给a++或b++都使方案数>=n则当前局势必败。若只有一个箱子,且再增加一个箱子就会使方案数大于n,那么只能增加a,那么只能增加b。


#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <string>  
#include <algorithm>  
#include <map>  
#include <set>
#include <stack>  
#include <queue>  
#include <vector>  
#include <bitset>  
#include <functional>  

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int a, b, n;

bool mypow(int k, int p)
{
	LL ans = 1, a = k;
	while (p)
	{
		if (p & 1) ans *= a;
		if (ans >= 1LL * n) return 0;
		a *= a;
		p /= 2;
	}
	return 1;
}

int dfs(int a, int b)
{
	if (a == 1)
	{
		if (!mypow(2, b)) return -1;
		if (!dfs(2, b)) return 1;
		return 1 - dfs(a, b + 1);
	}
	if (mypow(a, b + 1) && !dfs(a, b + 1)) return 1;
	if (mypow(a + 1, b) && !dfs(a + 1, b)) return 1;
	return 0;
}

int main()
{
	while (~scanf("%d %d %d", &a, &b, &n))
	{
		int ans = dfs(a, b);
		if (ans > 0) puts("Masha\n");
		else if (!ans) puts("Stas\n");
		else puts("Missing\n");
	}
	return 0;
}
查看评论

地面凹陷

   2D 游戏中有许多技巧来获得比较好的视觉效果, 使游戏更加吸引人. 最常见的是使用 Alpha 通道来做光影, 好象被人用烂了 ;-) 我们需要来点新奇的东西?   留意 Starcraft, ...
  • ghj1976
  • ghj1976
  • 2000-12-08 11:41:00
  • 1280

Codeforces 39E What Has Dirichlet Got to Do with That? 博弈+记忆化搜索

题目链接:点击打开链接 题意: 给定 a个箱子 b个球 常数n (球和箱子都是各不相同的,不会出现有一样的物品) 设 way = 把b个球放到a个箱子中的方法数, 若way >= n则游戏结束 ...
  • qq574857122
  • qq574857122
  • 2014-07-16 17:05:47
  • 1119

codeforces #39E

题目大意:有两个人玩游戏,每次对a或b进行加1的操作,使得a^b 解题思路:博弈类型动态规划,这里采用的是记忆化搜索,没有接触过此类问题的可以先做一下UVAOJ的10404,题目链接: https...
  • baidu_28239673
  • baidu_28239673
  • 2015-10-26 00:01:43
  • 425

CodeForces 39 E.What Has Dirichlet Got to Do with That?(博弈论+dfs)

Description 初始状态有aaa个不同的盒子和bbb个不同的物品,StasStasStas和MashaMashaMasha两个人轮流操作,StasStasStas先手,每步可以选择加一个不同...
  • V5ZSQ
  • V5ZSQ
  • 2018-03-31 14:21:29
  • 22

CF 39E What Has Dirichlet Got to Do with That? (博弈)

转载请注明出处,谢谢http://blog.csdn.net/ACM_cxlove?viewmode=contents    by---cxlove 题意:给出a ^ b,两个人轮流操作,可以  a...
  • ACM_cxlove
  • ACM_cxlove
  • 2013-08-26 13:28:51
  • 1848

codeforce -39E-What Has Dirichlet Got to Do with That?(博弈+dfs)

E. What Has Dirichlet Got to Do with That?time limit per test2 secondsmemory limit per test64 megaby...
  • albertluf
  • albertluf
  • 2018-04-11 15:38:09
  • 66

Codeforces Round #418 (Div. 2) problem A. An abandoned sentiment from past

A. An abandoned sentiment from past time limit per test 1 second memory limit per test 256 megab...
  • wushirenfeig
  • wushirenfeig
  • 2017-06-08 07:31:11
  • 755

have got 用法 & must,have to和have got to的用法

have got 用法一览表 ...
  • ahxiangf
  • ahxiangf
  • 2008-02-01 15:17:00
  • 5806

B. Reading codeforces-problem-234B

B. Reading time limit per test 1 second memory limit per test 256 megabytes input ...
  • aku8888
  • aku8888
  • 2017-01-12 00:21:26
  • 194

Codeforces Problem - 39E - What Has Dirichlet Got to Do with That?(博弈,记忆化搜索)

E. What Has Dirichlet Got to Do with That?time limit per test2 secondsmemory limit per test64 megaby...
  • w326159487
  • w326159487
  • 2018-04-10 22:03:33
  • 11
    个人资料
    持之以恒
    等级:
    访问量: 24万+
    积分: 1万+
    排名: 936
    文章分类
    最新评论