C++

Description Once upon a time there lived a king and he had N sons. and there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did like. the sons of the king were young and light-headed, so it was

Frogs 'neighborhoodTime Limit: 5000 MS Memory Limit: 10000 KTotal Submissions: 6076 Accepted: 2636 Special Judge Description There are N Lake L1, L2,..., Ln (including the lake without name) in the vicinity of Lake without name. Each lake Li

Gone Fishing John is going on a fishing trip. he has h hours available (), and there are n lakes in the area () all reachable along a single, one-way road. john starts at lake 1, but he can finish at any lake he wants. he can only travel from one

The question is: Give a number N and a base D. First, this number must be a prime number. Second, convert the number (1) to the number (2) to the number (3) to the number in decimal format, this decimal number is still a prime number. In this way,

Flag Value Meaning skipws 0x0001 skip spaces in input left 0x0002 output left alignment right 0x0004 output right alignment internal 0x0008 add after symbol or base indicator dec 0x0010 convert to decimal oct 0x0020 convert to octal hex 0x0040

What is a topological sequence?Generally, such a linear sequence is called a sequence that satisfies the Topological Order. In short, a full order is obtained from a partial order on a set. This operation is called topological sorting. Definitions

The question is also relatively simple. The approximate number is T. Each type has N [I] numbers and then uses these numbers to form some sequences, ask the number of x-length to y-length sequences, that is, DP [I] [j] indicates the number of the

Give A string of numbers as the currency value of the coin and distribute the coins to two people, A and B. The average is better. Assume that the total amount of money is Sum and the amount of money A receives cannot exceed B. Open the array dp, dp

Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission (s): 2027 Accepted Submission (s ): 741 Problem DescriptionDuring the Warring States Period of your ent China (476

  #include #include int a[100005]; int main(){ int n,x,y,i; while(scanf("%d",&n)!=EOF){ memset(a,0,sizeof(a)); if(n==0)break; for(i=1;i However, after all, it is learning tree arrays, so we still use tree arrays to re-AC,

# Include # include # include # include using namespace std; # define N 100005 struct per {char s [10]; int age, v;} p [N]; int cmp (const void *, const void * B) {struct per * x = (struct per *) a; struct per * y = (struct per *) B; if (x-> v! =

Idea: constructor matrix + rapid Power Analysis: 1 The question means that there are n people in a circle, and each person initially has an ai apple. Now I am playing m games, after each game, I personally can add R * A (I + N-1) % n + L * A (I + 1)

C ++ references are divided into left reference and right reference. In fact, it is easy to understand that the Left value in the left value reference refers to the value that can appear on the left of the equal sign (the variable with the name, the

Buy TicketsTime Limit: 4000 MS Memory Limit: 65536 KTotal Submissions: 10858 Accepted: 5272 DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue... The Lunar New Year was

Problem J: Train Tracks Andy loves his set of wooden trains and railroad tracks. each day, Daddy has to build a new track for him. the tracks he likes best form a simple loop with no branches or dead ends, so he can run his trains around and around

Question: give you n numbers and ask you to select m heap from these numbers to minimize the sum of each heap, the sum of a heap is the maximum value in the heap minus the square of the minimum value. At last, the sum of all the heaps must be

The role of the const qualifier: 1. Define a const constant: const can change an object into a constant and cannot be modified. Therefore, Initialization is required during definition, for example, const int bufsize = 512; 2. You can modify the

Calculate the minimum value of F (x) on [] for n quadratic functions Si (x), F (x) = max {Si (x. S (x) = ax ^ 2 + bx + c (0 # include using namespace std; const int maxn = 10000 + 10; int n, a [maxn], B [maxn], c [maxn]; double F (double x)

Shi Jie gave a question to a friend around him: O (1) the space complexity was merged and sorted by strokes on the grass paper. During the 20-minute coding debugging, the idea was: merge, merge (arr, l, m, n) places the I j indicator at l m + 1,

Analysis: It's hard to paste small ads (heavy fog ). Note that if the Interval Length is smaller than k, It is enough. This is the problem of deformation of the interval selection. After sorting, select from the end of each interval. Code: For a