loooooog的博客

DZY has a sequence a[1..n]. It is a permutation of integers 1∼n. Now he wants to perform two types of operations: 0lr: Sort a[l..r] in increasing order. 1lr: Sort a[l..r] in decreasing order. ...

Problem DescriptionIn mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest common measure (gcm), of two or more int...

Problem DescriptionCorrupt governors always find ways to get dirty money. Paint something, then sell the worthless painting at a high price to someone who wants to bribe him/her on an auction, this s...

Problem DescriptionThere are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this “How far is it if I want to go from house A to house B”...

Problem DescriptionFollowing is the recursive definition of Fibonacci sequence:Fi=⎧⎩⎨01Fi−1+Fi−2i = 0i = 1i > 1Now we need to check whether a number can be expressed as the product of numbers in...

Problem DescriptionIn mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relationFn = Fn-1 + Fn-2with seed values F1 = 1; F2 = 1 (sequence A000045 in OEIS).—Wiki...

Problem DescriptionIn geometry, collinearity is a property of a set of points, specifically, the property of lying on a single line. A set of points with this property is said to be collinear (often ...

Problem DescriptionMatt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know.A ring is a 2-D figure bounded ...

Problem DescriptionThe annual Games in frogs’ kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog athl...

Problem DescriptionIn our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 … in the same meaning. And here is the question: Suppose we have a matrix ca...

Problem DescriptionThere are 2 special dices on the table. On each face of the dice, a distinct number was written. Consider a1.a2,a3,a4,a5,a6 to be numbers written on top face, bottom face, left fac...

Problem DescriptionTom and Jerry are playing a game with tubes and pearls. The rule of the game is:Tom and Jerry come up together with a number K.Tom provides N tubes. Within each tube, there a...

Give you a sequence of N(N≤100,000) integers : a1,…,an(0#include<iostream>#include<cstdio>#include<map>#include<algorithm>#i

There is an apple tree in front of Taotao’s house. When autumn comes, n apples on the tree ripen, and Taotao will go to pick these apples. When Taotao picks apples, Taotao scans these apples from th...

XOR is a kind of bit operator, we define that as follow: for two binary base number A and B, let C=A XOR B, then for each bit of C, we can get its value by check the digit of corresponding position in...

Do you like painting? Little D doesn’t like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy painting, Little D asks you to write a program to ma...

Paint PearlsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3620 Accepted Submission(s): 1196Problem DescriptionLee has a string of n pea...

Problem DescriptionGiven a 3-dimension ellipsoid(椭球面)your task is to find the minimal distance between the original point (0,0,0) and points on the ellipsoid. The distance between two points (x1,y1,...

Problem DescriptionI used to think I could be anything, but now I know that I couldn’t do anything. So I started traveling.The nation looks like a connected bidirectional graph, and I am randomly wa...

Dlsj is competing in a contest with n (0 < n \le 20)n(0#include<iostream>#include<cstdio>#include<algorithm>#include<cstdlib>#include<