Others

for the first time, the Bubble Sorting is re, and changed to "OK". # Include # include #include #include using namespace STD; char temp [100] [10]; int CMP (const void * _ A, const void * _ B) {char * A = (char *) _ A; char * B = (char *) _ B; If

C # is used in the book. I changed it to C ++. I belong to the cainiao level. If any error occurs, please leave a message. # Include #include using namespace STD; Class operation {public: Double A; Double B; virtual double getresult () {};}; class

// Log2? //CodeRefer to the online version and use the bottoming formula # include # include # include int main () {int W, D, cout = 1; int dec = 5730, result; double temp, year; while (scanf ("% d ", & W, & D )! = EOF & W) {temp = 810.0 * W/D;

# Include # include int max (int A, int B) {return A> B? A: B;} int d [1001] [1001]; char S1 [2000]; char S2 [2000]; int main () {int la, LB, N; scanf ("% d", & N); While (n --) {memset (D, 0, sizeof (d); scanf ("% s", S1 ); la = strlen (S1);

Code is a little tedious to write. Sorry .... too lazy to calculate the array order # Include # include # include # include using namespace STD; int is_palindrome (char STR []); int is_mirrored (char STR []); int main () {int value; char STR [1

# Include # include # include using namespace STD; int main () {char STR [20]; int I, key; while (fgets (STR, 20, stdin) {If (STR [I] = '_') continue; Key = 0; for (I = 1; I

# Include # include # include # define stack_size 100 # define stack_increase 10 # define OK-100 # define error-1 // define typedef int qelemtype; // The definition depends on the object's typedef int status; typedef struct qnode {qelemtype data;

  I am not very fond of saying that I have not written a blog since I applied for a csdn account. Like most people, having no words to write should be the primary reason. In fact, writing should be a pleasant thing. So if you have time, start a

Its box image is as follows: (1 (2 (3 4) (2 (3 4) [*] -------------> [*] | V (2 (3 4 )) (3 4) 1 [*] ---------------> [*] | V (3 4) (4) 2 [*] ---------------> [*] -------------> '() | V 3 4 its tree image is as follows: (1 (2 (3 4 ))) */\ (2 (3 4) 1 *

Poj 1088 Memory-based search also uses recursive deep search to search for data. However, unlike direct deep search, memory-based search stores the results obtained during each search, this avoids repeated computation, which is called memory. Memory

Euler's path problem. Steps for determining whether there is an Euler's path in a directed graph: Determine the connectivity and determine the relationship between the inbound and outbound degrees of a vertex! First, because words are placed in a

The approximate meaning is to find the minimum number of characters that can be added to program the return string with the length of N. The minimum number of letters to be supplemented = the length of the original sequence s-s and the longest

The key to this question is to understand the meaning of the question: a tree with nodes numbered by 1-N, then delete the node with the smallest number in the current degree of 1, and write the label of the node associated with the node, repeat this

DFS first finds the sea and marks it out. Second, it marks the overseas DFS, and third, it finds the land. The starting point of the second DFS is all the points around the graph, so that the four directions of DFS will mark the things not

The most important thing about this question is a method to calculate the number of combinations. Obtain the sum of all coins and use memset(f,0,sizeof(f)); f[0]=1; for(int i=0; i=coin[i]; j--) { if(f[j-coin[

#include#includeusing namespace std;int n,m,k,seat[30],accept[30],max;typedef struct ord{ int start,end,number,earn;} ord;ord order[30];void dfs(int stop,int money,int cur){ max=max>money?max:money; if(stop==m) return ; int i,j;

Same as sgu231, time limit per test: 0.5 sec. Memory limit per test: 4096 kb. After the data is read, it is sorted in the ascending order of B, and then scanned forward from the back to record the current minimum value. If X [I]> min, it indicates

Question Link Description Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she 'd like to fill it with the best charms possible fromN(1 ≤N≤ 3,402) Available charms. Each charmIIn the supplied list has a

Question Link DescriptionA train has a locomotive that pulls the train with its own passenger coaches. if the locomotive breaks down, there is no way to pull the train. therefore, the office of railroads decided to distristmthree mini locomotives

Train swapping At an old railway station, you may still encounter one of the last remaining ''train swappers ''. A train Swapper is an employee of the railroad, whose sole job it is to rearrange the carriages of trains. Once the