2017年05月_牛犇犇123

转载 ACM: Nearest Numbers

ACM: Nearest NumbersDescription Given three integer sequences which have been sorted in ascending order,pick one integer from each sequence and we can get three integers.we want these three in

2017-05-30 17:52:40 293

原创 ACM： O: Assignments

ACM： O: AssignmentsDescription When Starfleet headquarters gets a request for an exploration expedition, they need to determine which ship from those currently docked in the docking bay to

2017-05-13 12:23:55 250

原创 ACM：Y: Three Jugs

ACM：Y: Three JugsDescription We have three jugs A, B, C without any calibration, and an infinite supply of water. There are three types of actions that you can use: (1) Fill a jug.

2017-05-12 18:22:24 373

原创 ACM:W: Super-increasing sequence

ACM:W: Super-increasing sequenceDescription如果一个序列中任意一项都大于前面所有项之和，那么我们就称这个序列为超递增序列。现在有一个整数序列，你可以将序列中任意相邻的若干项合并成一项，合并之后这项的值为合并前各项的值之和。通过若干次合并，最终一定能得到一个超递增序列，那么得到的超递增序列最多能有多少项呢？Input

2017-05-10 22:53:42 345

原创 ACM：R: Optimal Parking

ACM：R: Optimal ParkingDescriptionWhen shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs. Can you help Michael choose a place

2017-05-10 22:00:32 258

ACM:组合数末尾的零Description从m个不同元素中取出n (n ≤ m)个元素的所有组合的个数，叫做从m个不同元素中取出n个元素的组合数。组合数的计算公式如下:C(m, n) = m!/((m - n)!n!) 现在请问，如果将组合数C(m, n)写成二进制数，请问转这个二进制数末尾有多少个零。Input第一行是测试样例的个数T，接下来是T个测试样例，每个测试样例占一行，有两个数，依次是m

2017-05-09 15:15:19 340

原创 ACM:真三国无双

ACM:真三国无双Description真三国无双是魔兽的一个游戏，该游戏是以中国三国的历史背景而制作的，该游戏是5 V 5的游戏模式，敌对双方各5个英雄，推掉了对方的大本营就算取得了胜利。ZYH和SN都喜欢玩这个游戏，但是他们谁也不服谁，都觉得自己的操作比对方厉害，因此他们两人决定以单挑的方式来一决高下。ZYH选择了他最喜欢的英雄：关羽，SN也选择了他喜欢的英雄：典韦。在

2017-05-09 15:10:14 355

原创 ACM: Simple Line Editor

Simple Line EditorDescriptionEarly computer used line editor, which allowed text to be created and changed only within one line at a time. However, in line editor programs, typing, editing, an

2017-05-09 14:26:50 244

原创 ACM L: XueXX and Binary

L: XueXX and BinaryDescriptionXueXX is a clever boy. And he always likes numbers in binary(二进制). What an interesting hobby!Now XueXX has some number in decimal(十进制), he wants to know

2017-05-01 22:04:01 300

原创 2132: 中南大学2017年ACM暑期集训前期训练题集(入门题)

V: 剪刀石头布Description现在一共有N个人（分别记为1, 2, …, N）在玩剪刀石头布，如果知道他们每个人都出了什么，你能找出来谁是winner吗？当且仅当一个人可以赢其他所有人时，才称这个人是winner。我们将剪刀记作2，石头记作0，布记作5，那么胜负关系就应当是2能赢5，5能赢0，0能赢2。Input输入数据的第一行包含一个整

2017-05-01 21:48:46 333

niu15273122295的博客