Others

The tortoise can ride an electric car and build a charging station on the road. Each charging consumes t time. After each charging, he can ride a c distance. Idea: DP can not just look at the status of the I-1 charging station, because it may be

CodeI understand it myself ~~ # Include # include # include using namespace STD; int main () {char s [30] = "hello"; char P [30]; string CH = "map", SS; strcpy (p, ch. c_str (); // The string printf ("% s \ n", Ch. c_str (); // string to the

// Poker Hands (Poker) // PC/Ultraviolet IDs: 110202/10315, Popularity: C, Success rate: average Level: 2 // Verdict: Accepted // Submission Date: 2011-05-23 // UV Run Time: 0.008 s // copyright (C) 2011, Qiu. Metaphysis # yeah dot net // calculate

// Jolly Jumpers (happy leader) // PC/Ultraviolet IDs: 110201/10038, Popularity: A, Success rate: average Level: 1 // Verdict: Accepted // Submission Date: 2011-05-22 // UV Run Time: 0.020 s // copyright (C) 2011, Qiu. Metaphysis # yeah dot net ///

Sscanf () function usage SSCANF usage: (a better function discovered after qsort, bsearch, and strchr)Similar to scanf, sscanf is used for input, but the latter uses the keyboard (stdin) as the input source, and the former uses a fixed string as the

// Zoj2326Tangled in Cables// Use a rope of a given length to link the house in the village. The house can be regarded as a point.// There is only one road between each pair of houses. I use Kruscal.// The zoj platform is powerful ......// The cmp

# Include "stdio. h"# Include "string. h"# Deprecision MAX 1000Void LCSLength (int m, int n, char x [], char y [], int c [] [1000]){Int I, j;For (I = 0; I For (j = 0; j C [I] [j] = 0;For (I = 1; I For (j = 1; j {If (x [I] = y [j])C [I] [j] = c [I-1]

It's approaching the end of the period, and there's no time to refresh questions. I was so busy. I looked at brudi's "combined mathematics" and read the counting part first. Let's talk about the winter vacation part of the figure. The Learning rush

The Water Bowls Time Limit:1000 MS   Memory Limit:65536 K Total Submissions:3790   Accepted:1483 DescriptionThe cows have a line of 20 water bowls from which they drink. the bowls can be either right-side-up

The concept of BFS in a three-dimensional matrix is quite simple. However, I did not expect this during the graph creation process. As a result, it was WA for four times ,,,,,, Note that this is correct. For (int I = 1; I For (int k = 1; k For (int

Cow Exhibition Time Limit:1000 MS   Memory Limit:65536 K Total Submissions:7795   Accepted:2852 Description"Fat and docile, big and dumb, they look so stupid, they aren't much Fun ..." -Cows with Guns by Dana

Wooden Sticks Time Limit:1000 MS   Memory Limit:10000 K Total Submissions:16517   Accepted:6868 DescriptionThere is a pile of n wooden sticks. the length and weight of each stick are known in advance. the sticks

Ant Counting Time Limit:1000 MS   Memory Limit:65536 K Total Submissions:1954   Accepted:822 DescriptionBessie was poking around the ant hill one day watching the ants march to and fro while gathering food. she

I Love This Game Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 3740 Accepted Submission (s): 1286Problem DescriptionDo you like playing basketball? If you are, you may know the NBA Skills

Codeforce 298 Note: It is important to note that solar bear must pass through this lattice before it will cause changes in the marks. Only the three cases are returned. (1) RRRRR goes from 1 to 6 (2) LLLLLL goes from 6 to 1 (3) RRRRLLLLL in this

Question Link The score calculation is a classic problem. I started to use the overload Operator The error lies in the out-of-bounds between initialization and long multiplication. The second method is used. # Include // overload operator this

An interesting topic on diy at hangdian: After learning various algorithms, yuna decided to start learning number theory. Of course, yuna has learned from the simplest least common factor ~~~~~Defined as 1, 2 ,..., Minimum Public multiples of n, for

There are two game modes for the tower of Hanoi Problem: the first is the existence of 1, 2, 3 pillars, each time can only move the plate to the adjacent location, each can only move one plate. (If you move the plate on column 1 directly to column 3

I haven't written tree dp for a long time... in the past, we found leaf nodes first. using queue maintenance... this learning method of vector dynamic array + DFS rollback .. I feel the idea is clearer... The first question about the question... the

E-Seven tombsTime Limit: 3000/1000 ms (Java/Other) Memory Limit: 65535/32768 K (Java/Other) Total Submission (s): 31 Accepted Submission (s): 9 Font: times New Roman | Verdana | GeorgiaFont Size: tables → Problem Description tower. laxia is buried