Others

Poj_2243 After reading and converting the start and end points, you only need to start from the start point and8Perform extensive search at reachable locations and record the number of steps at the location in sequence. Exit the loop when the

Uva_10245 This question is another impact on my traditional thinking. At the beginning, I could not imagine how it would exist.N ^ 2The complexity is still small.AlgorithmAfter reading other people's blogs, I found out that the original topic

The 3N + 1 problem Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 8757 accepted submission (s): 3196 Problem descriptionproblems in computer science are often classified as belonging to a

Problem description: Set{1,2,3 ,...,N}The number of subsets without consecutive integers. Input: The input file contains several rows. Each row has a positive integer.NA group of test data ,(1 £.N ). Input until the end of the file.

A hard puzzle Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 13437 accepted submission (s): 4677 Problem descriptionlcy gives a hard puzzle to feng5166, LWG, jgshining And Ignatius: gave a and

Uva_10004 For this question, we can directly simulate the dyeing process. If we find that this Part has been colored and is different from the color we want to use, this figure cannot be dyed.Bicolorable. # Include Stdio. h > # Include

Uva_10012 This questionWaIt's so painful that I don't know whyWaLater, I realized that the difference between the radius of two adjacent circles was greatly reduced. That is to say, there may be many small circles under a large circle, so I had

Humble numbers Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 6085 accepted submission (s): 2639 Problem descriptiona number whose only prime factors are 2, 3, 5 or 7 is called a humble number.

Put the ball in the box Problem description: KPut the same ballsNDifferent boxes. Your task is to calculate the number of different release methods. Input: The input file contains several rows. Each row has two positive

Uva_167 This question is essentially a white book by Liu lujia.P125The eight queens issue. # Include Stdio. h > # Include String . H > Int A [ 10 ] [ 10 ], B [ 10 ], Ans; Void DFS ( Int Cur){ Int I, j, OK, temp; If

Uva_10344 Since the computing order has been given, you only need to enumerate the symbols andAICan be reused, but eachAIIt can be used only once. When recursion to allAIAll EnabledCheck whether the calculation result is23You can. #

The Calculation of GPA Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 9186 accepted submission (s): 2110 Problem description at the end of each semester, everyone is busy calculating their

Uva_000024 Because the tracing times out directly at the beginning, some data is made into tables. # Include Stdio. h > # Include String . H > Int M, n, [ 35 ]; Int DFS ( Int Cur){ Int I, j, S, C; If (Cur = M) Return

Http://poj.org/problem? Id = 1019 Question: Number Sequence Time limit:1000 ms Memory limit:10000 K Total submissions:24168 Accepted:6466 Description A single positive integer I is given. write

POJ_2362 With the foundation of POJ_1011, this question can be easily completed independently. #include#include#includeint state[10010],st[10010],d,n,sum;int cmp(const void *_p,const void *_q){int *p=(int *)_p;int *q=(int *)_q;return *q-*p; }int

UVA_108 To make full use of the calculated results, we can enumerate the position of the top left vertex of the rectangle before enumerating the size of the rectangle. In addition, when calculating the elements and time of a rectangle, we must make

HDU_4001 This is a relatively easy dynamic planning question. Since M must be in Shanghai every time during an activity, to achieve this State, either from the previous activity to the present M has been in Shanghai, either after the last activity,

UVA_10596 This is a pure Euler Loop problem. For more information about the theory, see Liu rujia's White Book P112. If this graph is connected and each vertex is connected only to an even number of links, then there must be an Euler loop.

HDU_1690 Use the Floyd algorithm to find the minimum cost between any two points. #include#include#includelong long int L1,L2,L3,L4,C1,C2,C3,C4;long long int f[110][110],d[110];int main(){int i,j,k,N,M,t,tt,a,b;long long int temp; scanf("%d",&t);

HDU_2236 To ensure that each column in each row has only one element, we can start with the idea of the maximum matching of the Bipartite Graph and view the rows and columns as the left and right parts of the Bipartite Graph, the Edge Weight of I-j