{"trustable":false,"sections":[{"title":"题目","value":{"format":"MD","content":"给你两个数n,k。\nn表示一个编号由1到n的的序列。\n2个人开始轮流从序列中选择一个最小为1,最多为k的连续的数。\n谁没法取数就输了比赛。\n给定n和k,输出谁能获胜。\nAdrien先手,Austin后手。\n输出获胜的人名\n\nNote提示\n假设n\u003d5,k\u003d3。\n序列为1,2,3,4,5\n假设第一个人选择了2,3,4这3个连续的数。\n那么第二个的策略集只有选择1或者选择5。不能同时选择是因为这2个数不连续。\n\nn的取值范围为(0\u003c\u003d n \u003c\u003d 1e9)\nk的取值范围为(1\u003c\u003dk\u003c\u003dmax(n,1))"}},{"title":"input1","value":{"format":"MD","content":"1 1"}},{"title":"output1","value":{"format":"MD","content":"Adrien"}},{"title":"input2","value":{"format":"MD","content":"9 3"}},{"title":"output2","value":{"format":"MD","content":"Adrien"}}]}