cloudy_happy的博客

A:Little C Loves 3 Itime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle C loves number «3» very much. He loves all things ab...

C. Powers Of Twotime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA positive integer xx is called a power of two if it can be repr...

C. Yuhao and a Parenthesistime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day, Yuhao came across a problem about checking if...

 Lakes in Berland CodeForces - 723DThe map of Berland is a rectangle of the size n × m, which consists of cells of size 1 × 1. Each cell is either land or water. The map is surrounded by the oce...

A. Vova and Traintime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVova plans to go to the conference by train. Initially, the trai...

Splitting moneytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter finding and moving to the new planet that supports human lif...

小于等于 CodeForces - 977C 给你一个长度为n的整数序列和一个数k。 您应该在[1; 1e9]（即1≤x≤1e9）的范围内输出任何整数x，使得给定序列的k个元素恰好小于或等于x。 请注意，该序列可以包含相同的元素。 如果没有这样的x，则输出“-1”（不含引号）Input第一行为n和k(1 <= n <= 2e5,0 <= k <= n)，第二行包含n个整数。...

有如下方程:x2 + s(x)·x - n = 0, 其中x, n是正整数, s(x) 是函数, 等于十进制数中x 的位数之和.明明有一个整数 n, 请你帮明明找到方程x最小的正整数根,或者确定没有这样的根.Input第一行包含整数n (1 ≤ n ≤ 1018)，是方程参数请不要使用%lld 读入. 推荐使用 cin, cout 流或 %I64dOutput输出 ...

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array d1,d2,…,dnd1,d2,…,dn consisting of nn integer numbers.Your...

                                                                C. Summarize to the Power of TwoA sequence a1,a2,…,ana1,a2,…,an is called good if, for each element aiai, there exists an element ajaj...

Fox And Two Dots CodeForces - 510B Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of size n × m cells, like this:Each cell contains a dot th...

. Vacationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has n days of vacations! So he decided to improve his IT skills ...

Equivalent Strings Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:They ...

Polycarp and Div 3Polycarp likes numbers that are divisible by 3.He has a huge number ss. Polycarp wants to cut from it the maximum number of numbers that are divisible by 33. To do this, he makes...

Pizza Separationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudents Vasya and Petya are studying at the BSU (Byteland State University)....

Coffee Breaktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Monocarp got a job. His working day lasts exactly mm minute...

C题：简单dp我们令dp[ i ][ j ]表示在选择第i列第 j ( j为0或 1代表两行)行元素的情况下当前的最大高度，那么他一定是从dp[ i-1 ][ ! j ]或dp[ i - 2 ][ ! j ]得到的；试想，对于9 3 5 7 3元素7，我们如果选择7的话，那么它一定是从元素1或是8的位置得到的，以为相邻 ...