![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
思维
文章平均质量分 80
黑脉金
这个作者很懒,什么都没留下…
展开
-
Is Derek lying?
DerekDerek and AlfiaAlfia are good friends.DerekDerek is Chinese,and AlfiaAlfia is Austrian.This summer holiday,they both participate in the summer camp of Borussia Dortmund.During the summer ca原创 2017-08-21 16:03:28 · 160 阅读 · 0 评论 -
Regular polygon
On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make.InputThe input file consists of several test cases. Each原创 2017-08-21 20:53:04 · 948 阅读 · 0 评论 -
扫雷
扫雷游戏是晨晨和小璐特别喜欢的智力游戏,她俩最近沉迷其中无法自拔。 该游戏的界面是一个矩阵,矩阵中有些格子中有一个地雷,其余格子中没有地雷。 游戏中,格子可能处于己知和未知的状态。如果一个己知的格子中没有地雷,那么该 格子上会写有一个一位数,表示与这个格子八连通相邻的格子中地雷总的数量。 现在,晨晨和小璐在一个3行N列(均从1开始用连续正整数编号)的矩阵中进 行游戏,在这个矩阵中,第2行的原创 2017-08-22 17:44:49 · 288 阅读 · 0 评论 -
Unrequited Love
There are n single boys and m single girls. Each of them may love none, one or several of other people unrequitedly and one-sidedly. For the coming q days, each night some of them will come together t原创 2017-08-23 21:07:52 · 344 阅读 · 0 评论 -
Draw Something Cheat
Have you played Draw Something? It's currently one of the hottest social drawing games on Apple iOS and Android Devices! In this game, you and your friend play in turn. You need to pick a word and dra原创 2017-08-23 21:09:55 · 302 阅读 · 0 评论 -
Yet Another Story of Rock-paper-scissors
Akihisa and Hideyoshi were lovers. They were sentenced to death by the FFF Inquisition. Ryou, the leader of the FFF Inquisition, promised that the winner of Rock-paper-scissors would be immune from th原创 2017-08-23 21:14:51 · 266 阅读 · 0 评论 -
英语考试
在过三个礼拜,YellowStar有一场专业英语考试,因此它必须着手开始复习。这天,YellowStar准备了n个需要背的单词,每个单词的长度均为m。YellowSatr准备采用联想记忆法来背诵这n个单词:1、如果YellowStar凭空背下一个新词T,需要消耗单词长度m的精力2、如果YellowSatr之前已经背诵了一些单词,它可以选择其中一个单词Si,然后通过联想记忆的方法去背原创 2017-08-24 15:15:22 · 212 阅读 · 0 评论 -
Salty Fish
海边躺着一排咸鱼,一些有梦想的咸鱼成功翻身(然而没有什么卵用),一些则是继续当咸鱼。一个善良的渔夫想要帮这些咸鱼翻身,但是渔夫比较懒,所以只会从某只咸鱼开始,往一个方向,一只只咸鱼翻过去,翻转若干只后就转身离去,深藏功与名。更准确地说,渔夫会选择一个区间[L,R],改变区间内所有咸鱼的状态,至少翻转一只咸鱼。渔夫离开后想知道如果他采取最优策略,最多有多少只咸鱼成功翻身,但是咸鱼大概有十万条,所原创 2017-08-24 15:17:27 · 813 阅读 · 0 评论 -
最小正整数
最小正整数时间限制(普通/Java):3000MS/10000MS 运行内存限制:65536KByte总提交:139 测试通过:34描述输入一个正整数N(N不超过240位,此整数中没有‘0’数字),去掉其中任意S个数字后剩下的数字按原左右次序将组成一个新的正整数。编程对给定的N和S,寻找一种方案使得剩下的数字组成的新数最小。输原创 2017-09-23 20:54:42 · 2773 阅读 · 0 评论