What Has Dirichlet Got to Do with That?（博弈最优化问题）（记忆化搜索可做）

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 ≤ 10000, 1 ≤ b ≤ 30, 2 ≤ 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 losi

 

 

思路：

 

之所以要特判a==1的情况是因为会出现无限循环。

初学者应该仔细体会前两个if。含义就是能赢我就赢，所谓的赢是 最终赢，因为是回溯上来的。

开始就是这个地方不理解所以想了很久。。。

这道题也可以用记忆化更快，弄个数组就好了。

跟https://blog.csdn.net/xianpingping/article/details/82626726

这道题有异曲同工之妙。

代码：

#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;
}