Others

There are only two ways to break down a number that cannot exceed 10,000,000. It's easy. My SolutionsCode: # Include # include # include # include # include using namespace STD; int main () {int N; int K; cin> N; For (int K = 0; k K;

This question is very simple. It only requires that the prime factor of a large number be output. You only need to pay attention to the number of long type. My SolutionsCodeAs follows: # Include # include # include # include # include

It's easy to find a regular question. My SolutionsCodeAs follows: # Include # include # include # include # include # include # include using namespace STD; int main () {int N; while (CIN> N & n! = 0) {int level = floor (SQRT (double (N-1)

How many tables Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 9066 accepted submission (s): 4429 Problem descriptionToday is Ignatius 'birthday. he invites a lot of friends. now it's dinner

To solve this problem, we need to determine whether all points are in the same set and whether the degrees of each point are even (that is, whether an Euler loop can be formed ). Use DFS to get the number of the midpoint of a connected component,

Sufficient and sufficient condition for an undirected graph to have Euler's loop An undirected graph has an Euler loop. if and only when all vertices in the graph are even and the graph is connected. Necessary and Sufficient Conditions for a

# Include "stdio. H"# Include "string. H"Struct point{Int X, Y;Int sum;} A [200000*3];Int H, W, N;Int max (int A, int B){A = A> B? A: B;Return;}Void tree (int t, int X, int y){A [T]. x = X;A [T]. Y = y;A [T]. Sum = W;If (x = y)Return;Int temp = T * 2

# Include "stdio. H"# Include "string. H"# Include "queue"Int R [100] [100];Int pre [1000];Int visit [1000];# Define INF 999999999Using namespace STD;Int n, m;Int BFS (int s, int t) // find the augmented path.{Int P, I;Memset (PRE, 0, sizeof (pre ));

Question: Given a string, you can delete a substring each time and ask the minimum number of times to delete the entire string. Ideas: State compression is used to enumerate all States, and an array is used to record the minimum number of times all

This question is very simple. First, use N to break down the factor with a prime number of, (that is, a prime number of less than 10) (first, we need to make a special judgment that N is not 1 ), then merge the factors that can be merged (for

This question is solved by brute force + dynamic planning. The analysis is as follows: For a 1 * M matrix, that is, a series, maximal sub-rectangle can be obtained by finding the maximum long continuous string and dynamic programming ). Then, for

This is really an interesting question. I don't know what others think. In short, I think this question is really interesting and worth doing. Attach a question first: There are lots of number games for children. These games are pretty easy to play

Maximum Flow with minimum cost The maximum flow of the minimum cost is generally implemented using an adjacent table, because the adjacent matrix cannot process parallel edges and so on, while a directed edge stores two pieces of information, if an

  // The method for doing this is to eliminate each point once,// Check whether it is zero at the last vertex ..# Include "stdio. H"# Include "string. H"Int main (){Int N, I;Int A [1000];While (scanf ("% d", & N), n! =-1){A [1] = N;For (I = 2; I

# Include "stdio. H"# Include "string. H"Int map [70000];Int main (){Int m, I, J;While (scanf ("% d", & M )! = EOF){J = 1;For (I = 2; I {While (M % I)I ++;M = m/I;Map [J ++] = I;}For (I = 1; I {Printf ("% d", map [I]);If (I Printf ("*");}Printf ("\

  # Include # Include # Include Int pre [2000];Using namespace STD;Struct point{Int x, y, z;}A [2000];Bool CMP (point a, point B){Return A. z }Int fun (int x){If (X! = Pre [x])Pre [x] = fun (pre [x]);Return pre [x];}Int main (){Int m, n, I, J, K, H,

You can use both the maximum stream and the query set. But somehow, the maximum stream always times out and expires... A blank graph is provided. Some nodes have wealth and some nodes have warehouses. It is required that all treasures be carried to

This is simple. You can call the prim algorithm (using the query set) to find the Minimum Spanning Tree. My problem-solving code is as follows: #include #include #include #include #include #include #include using namespace std;double

The meaning of the question is clear, but note that the condition for judging the end of The for loop is: After this round of reporting, M = 3 ..   # Include "stdio. H"# Include "string. H"Int main (){Int n, m, K, I, S, T;Int A [6000];Scanf ("% d", &

/* To calculate the number of steps in a loop,Use visit and the number of steps at each point;At the same time, it also marks the role .. */     # Include "stdio. H"# Include "string. H"Char map [100] [100];Int visit [100] [100];Int n, m, step;Int