C++

Description Donald wishes to send a gift to his new nephew, Fooey. donald is a bit of a traditionalist, so he has chosen to send a set of N classic baby blocks. each block is a cube, 1 inch by 1 inch by 1 inch. donald wants to stack the blocks

DescriptionThere is a discrete function. it is specified for integer arguments from 1 to N (2 ≤n ≤100000 ). each value of the function is longint (signed long in C ++ ). you have to find such two points of the function for which all points between

[Cpp]// Wang zhiquanEnum {ST_1 = 0x01 ST_2 = 0x01 ST_3 = 0x01 ST_4 = 0x01 ST_5 = 0x01  }; Class StateTest{Public: StateTest (): _ state (0 ){} ~ StateTest (){} // Set the specified status// @ Param tag status// @ Param enable whether to enableVoid

Recently, some OpenEXR related components need to be installed in Windows. After some attempts, the following steps are required.1) download related componentsCreate a directory libs-x86 under drive C, download the latest stable release from OpenEXR

Question: There is a string of numbers. to sort them in ascending order, two numbers can be exchanged each time. The price of one exchange is the sum of the two numbers. The minimum cost is required.Http://poj.org/problem? Id = 3270This is a classic

Question: 3 steps from N to K: Add 1, subtract 1, and multiply 2. Calculates the minimum number of steps from N to K.Idea: BFS[Cpp]# Include # Include # Include Using namespace std; Int n, k, cnt [111111]; Void bfs (){Queue q;Q. push (n );Cnt [n] =

This interview question contains 40 questions. It is a hot one that can be found online, but the answer is not very detailed and complete. The basic answer is cocoaChina, and some of your own supplements.1. Difference between shallow copy and deep

[Cpp]/*Question: enter a dictionary, and then enter a word to determine whether the word exists in the dictionary, or whether to delete, add, or replace the word. If yes, the words in the dictionary are output.Output according to the input

The plan of city rebuildTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 583 Accepted Submission (s): 201 Problem DescriptionNews comes !~ City W will be rebuilt with the expectation to become a

Extended Euclidean inverse element (as long as a and B are mutually unique, there is a inverse element)[Cpp]# Include # Include # Include # Include # Define mod 9973.Typedef long ll;Void ExGcd (int a, int B, int & x, int & y ){If (B = 0 ){X = 1;Y = 0

Question: cover all vertices with the smallest circleYou can use either of the following methods.First, the random incremental algorithmBytes ------------------------------------------------------------------------------------Algorithm:A. Make Ci

Question: Super stepsDescriptionThere is a total of m-level stairs. At the beginning, you are at the first level. If you can only cross the upper or second level at a time, how many steps should you go to the level m?Note: There are 0 steps from

Static member variables do not belong to a specific object. They belong to the member variables of all objects in the class. when instantiating an object, they may not be able to open up memory for it, therefore, we need to open up memory for him

Trie tree Transfer [Cpp]# Include # Include # Define maxn400003# Define SN 26# Define MAXL 300003# Define MOD 20071027.Using namespace std; Struct Trie {Trie * s [SN];Bool end;Void clear (){Memset (s, 0, sizeof (s ));End = false;}} Trie [MAXN]; Char

Number of wordsTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 16105 Accepted Submission (s): 4187 Problem DescriptionLily's good friend xiaoou333 was blank recently. He thought of a meaningless

[Cpp]/** Status: 10540903 10168 Summation of Four Primes Accepted C ++ 0.864 02:49:48* Url: http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 1109* Time: 2012.8.30 around* Strategy**/#

Insert sorting is a stable sorting. The average and worst case algorithm complexity is O (n ^ 2), and the best case is O (n). The spatial complexity is: O (1 ). [Cpp]# Include  Void InsertSort (int a [], int n){Int I, j, rc; For (I = 1; I {If (a [I-1

1. Reverse the words in a given English sentence (string) in C or C ++ without requiring a separate buffer to hold the reversed string (programming) For example: Input: REALLY DOGSDISLIKE MONKEYS Output: MONKEYS DISLIKEDOGS REALLY   I posted my

Question: Give You n numbers and divide them into m groups. Each group must be a continuous number, and the maximum value of the sum in each group is the minimum.Idea: bipartite enumeration answers. The upper bound is the sum of n numbers, that is,

Given a square rectangle of n * m, calculate the number of solutions completely covered by a small rectangle of 1*2, n Solution: a typical type of State DP is that the child rectangle covers the parent rectangle. This type of DP compresses the 01