- 博客(11)
- 资源 (9)
- 收藏
- 关注
原创 CodeForce Round #479 B. Karen and Coffee
B. Karen and Coffeetime limit per test2.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputTo stay woke and attentive during classes, Karen needs some coffee!Karen, a coffee aficionado, wants to know the optimal temp
2017-06-18 10:22:41 489
原创 CodeForce Round #479 A. Karen and Morning
A. Karen and Morningtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputKaren is getting ready
2017-06-18 10:16:38 421
原创 2017 山东理工第九届校赛 J LL
LLTime Limit: 100MS Memory Limit: 65536KBSubmit StatisticProblem Description这一天希酱又补了一卦,没想到每个人都发到了一张印有整数的牌,现在希酱想要继续占卜的话需要知道每个人手里拿的牌的整数具体是多少,但是她们却打起了哑谜。 穗乃果:我拿到的是 2
2017-06-04 20:32:31 533
原创 2017 山东理工第九届校赛 H C~K玩游戏(博弈)
C~K玩游戏Time Limit: 1000MS Memory Limit: 65536KBSubmit StatisticProblem DescriptionC~K 和 PBH 经常玩一个游戏。游戏规则如下:现给定一个 n*n 的棋盘,一个石头被放在棋盘的左上角。他们轮流移动石头。每一回合,两个人只能把石头向上,下,左,右四个方向移动一格,并且要求移动到的格子之前不能被访问过。谁不能移动石头了就算输。假如 C~K 先移动石头,而且 C~K 和 PBH 都足够聪明,那么最后谁能赢?Inpu
2017-06-04 18:31:48 571
原创 2017 山东理工第九届校赛 C 康纳的表情包
康纳的表情包Time Limit: 1000MS Memory Limit: 65536KBSubmit StatisticProblem DescriptionUMR 现在手里有 n 张康纳的表情,最上面一张是玛吉呀巴库乃。现在 UMR 如果每次把最上面的 m 张牌移到最下面而不改变他们的顺序及朝向,那么至少经过多少次移动玛吉呀巴库乃才会又出现在最上面呢?3917Input多组输入。每组输入以空格分隔的两个整数 n 和 m(题目中所提及的)。1 <= n, m <= 10^9Out
2017-06-04 18:23:08 1449 1
原创 2017 山东理工第九届校赛 A N!(神坑)
N!Time Limit: 1000MS Memory Limit: 65536KBSubmit StatisticProblem Description给出两个数 n, m。求 3748-1 和 3748-2。计算公式:3748-3Input输入数据有多组(数据组数不超过 250),到 EOF 结束。对于每组数据,输入两个用空格隔开的整数 n, m (0 <= m <= n <= 20) 。Output对于每组数据输出一行, 3748-1 和 3748-2。Example I
2017-06-04 18:19:27 1051
原创 HDU 2188 悼念512汶川大地震遇难同胞——选拔志愿者(博弈)
悼念512汶川大地震遇难同胞——选拔志愿者Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9779 Accepted Submission(s): 6196Problem Descrip
2017-06-04 08:29:39 636
原创 HDU 2701 Max Factor
Max FactorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8635 Accepted Submission(s): 2817Problem DescriptionTo improve the organization of his farm, Farmer John labels each of his N (1 <=
2017-06-04 08:24:44 497
原创 HDU 2709 Sumsets(递推)
SumsetsTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2814 Accepted Submission(s): 1124Problem DescriptionFarmer J
2017-06-04 08:18:37 415
原创 HDU 2700 Parity (水题)
ParityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4802 Accepted Submission(s): 3609Problem DescriptionA bit string has odd parity if the number of 1's is odd. A bit string has even pari
2017-06-04 08:10:34 462
原创 HDU 2124 Repair the Wall(贪心)
Repair the WallTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4473 Accepted Submission(s): 2208Problem DescriptionLong time ago , Kitty lived in a small village. The air was fresh and the
2017-06-04 08:04:04 356
数据结构之树状数组讲解
2018-07-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人