qq_45924838的博客

题目链接：https://codeforces.com/problemset/problem/1430/C 题意 从1到n的数，每次选择两个数删除，添加（a+b）/2的操作，使得留下的最后一个数可以最小。 注意 n=2时 输出 2 1 2 思路 每次选择最后一个数，然后往前选择奇偶性相同的数进行操作。 #include"iostream" #include"cstdio" #include"stdlib.h" #include"cstring" #include"cstdlib" #include"vec.

Period Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18971 Accepted Submission(s): 8820 Problem Description For each prefix of a given string S with N characters (each character has an ASCII cod

Shuffle’m Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21491 Accepted: 9677 Description A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker

Public Sale Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14368 Accepted Submission(s): 8277 Problem Description 虽然不想，但是现实总归是现实，Lele始终没有逃过退学的命运，因为他没有拿到奖学金。现在等待他的，就是像FarmJohn一样的农田生涯。 要种田得有田才行，Lel

Graveyard Design Time Limit: 10000MS Memory Limit: 64000K Total Submissions: 12631 Accepted: 3215 Case Time Limit: 2000MS King George has recently decided that he would like to have a new design for the royal graveyard. The graveyard must consist of seve

Supermarket Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 25038 Accepted: 11006 Description A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral