C++

# Inputs // data input port # defineP_1668DATLATA0 // data output port # defineP_1668CLKLATA1 # defineP_1668CSLATC0 # Signature = 1 # Signature = 0 # Signature = 1 # Signature = 0 # Signature = 0 # Signature = 1 # Signature = 0 // display mode

Board partitioningTime Limit: 1000 MS Memory Limit: 10000 KTotal Submissions: 11013 Accepted: 3869 Description Split an 8*8 checker as follows: Cut the original checker down a rectangle checker and make the remaining part as a rectangle. Then, split

Slash Maze By filling a rectangle with slashes (/) and backslashes (), you can generate nice little mazes. Here is an example:   As you can see, paths in the maze cannot branch, so the whole maze only contains cyclic paths and paths entering

 Simple stone game, simple application of SG functions. I have time to summarize Nim and SG functions ...... Temporarily put on hold # Include # include # define N 1002int n, T, m, sg [N]; bool vis [N]; int main () {scanf ("% d", & T); while (T -

Problem DescriptionLL is addicted to AC recently, and has 2.1 million lines of dormitory and data center every day. Due to a long time of sitting on the computer side, lack of exercise. He decided to take a walk on campus every time from the

This question can be searched, because it is the shortest time, and the search directly thinks of wide search (BFS ). Q: first, I will tell you that there are n floors. I want you to take the shortest time from floor A to floor B. Restrictions and

Perform matrix multiplication using the binary power.   # Include using namespace std; int f (int n) {if (n = 0 | n = 1) return n; int a2 = 1, a1 = 1, a0 = 0, f2 = 1, f1 = 0, f0 = 1, p2, p1, p0; n --; if (n = 1) return a2; while (n) {if (n % 2)

Question: Give n points on the plane and find a straight line So that all points are on the same side of the straight line (or on the same line) And the distance to the straight line is as small as possible. Minimum Average distance Ideas: All

A little girl dreamed of becoming a movie star from an early age. Now, there are many movie companies looking for her to make movies, but there may be conflicts between the schedules of these movies, but some girls don't want to miss any chance.

RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 8096 Accepted Submission (s): 3063   Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the

N m indicates n nodes and m edges. The m row a B indicates that a-B has a directed edge. Question: Given a directed graph, after deleting a vertex, you can find the maximum number of points in the strongly connected component of the graph. Q: What

The end of the school year is near and Ms. manana, the teacher, will soon have to say goodbye to a yet another class. she decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia states, is a

Minimal coverage   The ProblemGiven several segments of line (int the X axis) with coordinates [Li, Ri]. you are to choose the minimal amount of them, such they wocould completely cover the segment [0, M]. The Input The first line is the number of

  Question: enter a vertex on a convex bag (the vertex inside the convex bag is not, either a convex bag vertex or a dot on the convex bag side) to check whether the convex bag is stable. Stability It is determined whether the convex hull can be

If VS2012 is installed, open a console window provided by VS 2012, such as VS2012 x64 Native Tools Command Prompt. Run the following command to view the program header information:   gdal_1.8_rtc>dumpbin /HEADERS gdal18.dll Microsoft (R) COFF/PE

There are many articles on the Internet that discuss the differences between C ++'s "reference" and "pointer". When talking about the differences, one of them is: "reference cannot be blank (NULL ), references must be associated with valid storage

Analysis: (1) calculate the maximum continuous subsequence, and finally output the maximum subsequence value and the starting and ending elements of the subsequence. If all arrays are negative, 0 and the first and last elements of the array are

# Include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include using namespace std; char str [20] [50];

In the previous article, premake created a simple C ++ project in the Ubuntu and GCC environments. Although it can work, it is not very familiar with it. Later, I spent some time reading lua's syntax and thought I understood it. Later I looked back

Codility adds exercise lesson 2. There are three questions: (1) Perm-Check the given integer array has N numbers. Ask if it is an arrangement of 1-N, that is, whether each number is 1-N and only appears once. Output 1 and 0 indicate whether or not,