C++

  Play the sample inside the cocos2d-html5 MoonWarriros, I feel that the effect is doing quite well, but the source code is javascript, the monks will not this language. C ++ code contributed by others on github, but there are still problems.

Unsigned release (retain (* autorelease (retainCount (); CCAutoreleasePool: addObject (CCObject *-> m_uReference>, ++ (pObject-> release ();} = (! CCPoolManager: sharedPoolManager ()-> (! NCount = m_pReleasePoolStack-> (nCount>

  Code download   # Include "CELLWinApp. hpp"# Include # Include # Include # Pragma comment (lib, "opengl32.lib ")# Pragma comment (lib, "glu32.lib ")# Pragma comment (lib, "winmm. lib ") /*** This example describes how to

Description:Given a tree, two nodes in the tree are given at the same time to find their lowest common ancestor. Input:The input may contain multiple test examples.For each test case, the number of input first act is n (0 Each test sample contains

  Priority queue-The estimated function of A * cannot be the distance from the snake header to (). This will cause an error. After reading discuss, I have A strong saying that the evaluation function of this question A * Is BFS () and the cost of

  The key to this question is how to skip useless nodes. You can use a linked list. Each node points to it or the available node on its right. But search for tragedies Therefore, we can use and query the set to point all nodes to [it or the

I. Problem DescriptionFirst, let's explain what the reverse order number is. We are familiar with the natural sorting, that is, the numbers are placed before the large numbers compared with decimal places. If a large number is placed before a

Previously, I used DFS to do this, and the result timed out. I did it only after reading other people's practices. Now I am using BFS. It is obvious that it is much easier to use BFS. # Include # include # include # include using namespace std;

This is a mathematical question. The question is roughly to ask whether a certain number is "modest", that is, to satisfy all the factors from 2, 3, 5, 7. The data composed of the four qualitative factors then asks how many factors the number

Artillery positionsTime Limit: 2000 MS Memory Limit: 65536 KTotal Submissions: 15261 Accepted: 5743 Description The generals of the Headquarters intend to deploy their artillery troops on the grid map of N * M. A n * M map consists of N rows and M

Given a coordinate (n, m), calculate the coordinate numbers of x and y in the (1, 1) to (n, m) range. Train of Thought: traverse the number of mutual qualities with m by using the volume rejection from 2 to n. #include #include #include

An array with N integer elements (A [0], A [1], A [2],..., A [n-1]). Of course, this array has many sub-arrays. What is the maximum value of the sum of sub-arrays? For example, the maximum sub-array of-2 5 3-6 4-8 6 is 5 3. Method 1: search by

Problem DescriptionA snil is at the bottom of a 6-foot well and wants to climb to the top. the snail Il can climb 3 feet while the sun is up, but slides down 1 foot at night while sleeping. the snail Il has a fatigue factor of 10%, which means that

There are n skills. Each skill can only be used once. The monster has m points of blood and asks how many skills are required to kill the monster. Each skill has two values: a and B. a indicates the attack power. B indicates that when the volume of

Algorithms: Design and Analysis. Chapter 1 describes the partitioning algorithm, namely, DC. This chapter describes quick sorting. The difficulty of the job has been increased. After the Problem Sets were done twice, they accidentally scored only

Extension problem: Write a function. Given a head pointer of a linked list, you must traverse the elements in a single-chain table only once in reverse order. # Include # include # include # include using namespace std; struct node {int data;

If you are greedy, you can use map to record the subscript of each number. Each time we take the first and last two. Delete the negative intermediate weight and obtain the maximum sum

1. topological sorting (1) for example, some courses must be learned first. Use a graph to describe this stuff: So, the question is, can we find a sequence so that all the courses in this sequence meet the requirements: the first course is before

Problem description: the hot summer training session is coming to an end. In this short 20 days, everyone has worked very hard, because many of them are bachelors. Because of balabala, Marknoon has always been worried. After all, he is single. One

Fill in the square of the rectangle of 1*2 and 2*1 for an area of n * m. Solution: You can use a contour line. For each grid, enumerate the status of the previous grid to obtain all the status values of the current grid. Dp [cur] [s] indicates the