嵩韵儿

http://codeforces.com/problemset/problem/1213/CPolycarp is reading a book consisting ofnpages numbered from1ton. Every time he finishes the page with the number divisible bym, he writes do...

http://codeforces.com/problemset/problem/1213/AYou are givennnchips on a number line. Theii-th chip is placed at the integer coordinatexixi. Some chipscan have equal coordinates.You can perf...

目录A.Strange TableB.Partial ReplacementC.Double-ended StringsD.Epic TransformationE.Restoring the PermutationF.Triangular PathsG.Maximize the Remaining StringA.Strange Table题意：给出n，m，x，表示nm矩阵，输出以按列排列 的矩阵中 数x 的位置 的按行排列的值输入 3 5 11输...

目录A. Spy Detected!B. Almost RectangleC.A-B PalindromeD.Corrupted ArrayE.Permutation by SumF.EducationA.Spy Detected!B.Almost RectangleC.A-B PalindromeD.Corrupted ArrayE.Permutation by SumF.Education

Average HeightClick to the topic link题意：n个数排序，尽可能多的使得 相邻两个数的平均数是整数；题解：即只需奇数排在一起，偶数排在一起~#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;typedef long long ll;const int N=100..

Nastia and Nearly Good Numbers #include<bits/stdc++.h>using namespace std;typedef long long ll;/* a|b: b=ka,a整除b 或 b能被a整除good number:能被 a*b 整除nearly number: 能被 a 整除*///x+y=z 其中一个是good number,其余为nearly numberint main() { int t; cin>&

题目链接B. Morning JoggingThe 2050 volunteers are organizing the "Run! Chase the Rising Sun" activity. Starting on Apr 25 at 7:30 am, runners will complete the 6km trail around the Yunqi town.There aren+1n+1checkpoints on the trail. They are numbered b..

题目链接A number is called2050-numberif it is2050, 20500, ..., (2050⋅10k for integer k≥0).Given a numbern, you are asked to representnas the sum of some (not necessarily distinct) 2050-numbers. Compute the minimum number of 2050-numbers required for ...

#681 div.2 C题链接得到dishes的两种方式：the dish will be delivered by a courier from the restauranti, in this case the courier will arrive inaiminutes, Petya goes to the restaurantion his own and picks up the dish, he will spendbiminutes on this.举个栗子...

CF题目链接Long time no see...时隔多月，终于又回来了....csdn大佬云集，study harder and make progress everyday...You are given an arrayaconsisting ofnintegers numbered from1ton.给你一个数组a，存有n个数，从1~nLet's define thek-amazing number of the array as the minimum number...

官方题解codeforces.com/problemset/problem/1348/A题意：给你一个整数n，然后将2的1次方~2的n次方分成两部分，使两部分的和的差最小思路：以2为首项，2为公比的等比数列，要求分成两个数列，使得这两个数列和的差最小。对于指数级增长的数列，最后一个肯定为最大，即（2^n）>（2 ^ 1+2 ^2+2 ^3+…+2 ^(n-1)），所以把2的n...

CodeForces - 1327A传送门数据：InputThe first line of the input contains one integer t (1≤t≤105) — the number of test cases.The next tt lines describe test cases. The only line of the test case cont...

题目传送门数据：Input54 8 2 6 24 5 4 1 3Output7Input41 3 2 41 3 2 4Output0输入n（2<=n<=2*2e5）然后n个a[i] （表示老师感兴趣的话题） ; n个b[i] （表示学生感兴趣的话题）; （0<a,b<1e9）题意：...

http://codeforces.com/problemset/problem/1249/D1The only difference between easy and hard versions is constraints.You are given nn segments on the coordinate axis OX . Segments can intersect, ...

http://codeforces.com/problemset/problem/1249/E题意：n层楼，a[i] (0<i<n)表示从 i 楼到 i + 1 楼走楼梯的时间，b[i] (0<i<n)表示从 i 楼到 i + 1 楼乘电梯的时间，其中每一次乘电梯需要等待 c 时间，求从1楼到 1 ~ n 层楼所需要的最短时间思路：二维数组d...

http://codeforces.com/problemset/problem/1249/C2The only difference between easy and hard versions is the maximum value of n .You are given a positive integer number n . You really love good n...

http://codeforces.com/problemset/problem/1249/B2The only difference between easy and hard versions is constraints.There are n kids, each of them is reading a unique book. At the end of any day...

http://codeforces.com/problemset/problem/1238/CYou are playing a game where your character should overcome different obstacles. The current problem is to come down from a cliff. The cliff has he...

题目You are given a sequence a1,a2,…,an consisting of nn integers.You may perform the following operation on this sequence: choose any element and either increase or decrease it by one.Calcula...

题目You are given a tree consisting of nn vertices. A tree is an undirected connected acyclic graph. Example of a tree.You have to paint each vertex into one of three colors. For each vertex, yo...

https://codeforces.com/problemset/problem/1230/CAnadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1≤a≤b≤6 , there is exactly ...