C++

What is type conversion?The meaning of type conversion is to change the expression of a variable by changing its type to another type. To convert a simple object to another object of type conversion, you will use the traditional type conversion

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

  The birthday cake has m layers and the total volume is V. From bottom up, the radius r and height h of each layer are decreasing. For m and v, obtain the smallest surface area s. (Not counted from the ground area on the bottom) Link:

Simple Function -------------------------------------------------------------------------------- Time Limit: 2 Seconds Memory Limit: 32768 KB -------------------------------------------------------------------------------- Knowing that x can be any

A two-way linked list adds a forward link based on a one-way linked list. Many of the processing methods are similar. For example, you can find the length of a linked list or a node. All similar parts are not implemented one by one. If you are

Description: Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the

Question requirements (1) | ai | | ai-aj |> = T. Because (1) conditions exist, (2) conditions can be established only when ai and aj are positive and negative. It can be seen that the positive and negative values of an element on a certain road in

Description: Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and 110 is a binary number. now for any pair of positive integers N1 and N2, your task is to

Digital triangle of water, DP transfer equation: dp [I] [j] = max (dp [I-1] [J-1], dp [I-1] [j]) + num [I] [j]. (j> 1); dp [I] [j] = dp [I-1] [j] + num [I] [j] (j = 1) find the maximum value in the last line dp [N] [I. Code: #include #include

Solution: first build the graph, note that it is a directed graph, and then use 1 as the source point, the enumeration level limit, that is to say, each time we use spfa to get 1 point to other points that can be reached (due to the level limit, not

In question B of Chengdu Regional in 2012, it took an hour to release the formula, but after a long time, I found that I could not control the accuracy. Then I suddenly thought that the number of combinations could be optimized using log, after the

There are N jobs and M machines. Each job can only run on the same machine for one day, and only one job can be run on each machine for one day, the I-th job must be completed on the pi Day, and only Pi days can be selected from Si to Ei. If all the

SG function: Given a directed acyclic graph and a piece of chess on the starting vertex, the two players move the piece along the directed edge alternately, and cannot determine the negative operator. In fact, this game can be considered as an

The nominal value of n coins should be divided into two heaps (the average number is not required), and the absolute value of the sum of the two heaps of coins should be minimized, the absolute value of the minimum output value. Solution: Consider

Problem Description has N teams (1 # Include # include # include # define maxn 510 using namespace std; int map [maxn] [maxn]; // path int in_degree [maxn]; // inbound int ans [maxn]; int n, m, x, y; void topo () {for (int I = 1; I   

Strcpy and memcpy are both standard C library functions, which have the following features. Strcpy provides string replication. That is, strcpy is only used for string copying. It not only copies the content of the string, but also copies the end

1. vector memory growth one of the features of vector: memory space will only grow, will not decrease, quoted C ++ Primer: To support fast random access, vector container elements are stored in a continuous manner, each element is stored next to the

In fact, this question is very simple. bfs or dfs finds all connected O, and if there is one of these O, it will remain unchanged; otherwise it will be surrounded, all of them can be changed to X, but bfs has not been written for a long time, which

Solution: 1004 question Description: give you n vertices, m undirected edges, each side has a length d and a cost p, give you a start point s end point t, it is required to output the shortest distance from the start point to the end point and its

# Include # include # include # include # define maxn 10 # define INF 0x3f3f3fusing namespace std; int n, m, ans, flag, depth; int mp [maxn] [maxn]; int dx [] = {-,}; int dy [] = }; bool vis [maxn] [maxn]; struct Node {int x, y;} cur, now, q [100