Others

Returns the distance dx, Dy for each walk. calculates the number of points inside the polygon, the number of points on the edge, and the area.   # include # include # include using namespace STD; struct point {int X,

On a lattice paper, there are two parallel lines in the vertical and horizontal lines, and the distance between adjacent parallel lines is equal. In this way, the intersection of the two parallel lines is calledGrid point. A = 39, B = 14, S = 45

Who would have missed this question during the competition, and then would have regretted it? First, the question is very simple, that is, let you remove the minimum number of edges in the graph and make the distance between any two points in the

DP [I] [J] indicates that j pairs are selected from the previous I, DP [I] [J] = min (DP [I-2] [J-1] + (A [I]-A [I-1]) ^ 2, DP [I-1] [J]) Sort first, pay attention to Initialization # Include # include # include # include using namespace STD;

High-Precision multiplication and string processing   # Include # include # include using namespace STD; int s; void Chen (char a [], char B []) // A = a * B {int I, J, K, L, sum, C [410] = {0}; L = strlen (A) + strlen (B ); for (I = strlen (B)

// ultraviolet A 10881 # include # include # include # define n 10005 using namespace STD; struct ant {int ID, X; int Z; // in a left-side, 0 collision, 1 to the right bool operator T; while (t --) {char s; int X, z;

Card Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 894 accepted submission (s): 518Problem descriptionbearchild is playing a card game with himself. But first of all, he needs to shuffle the

Gcc Time Limit: 1000/1000 MS (Java/others) memory limit: 131072/131072 K (Java/Others)Total submission (s): 3190 accepted submission (s): 1004 Problem descriptionthe GNU Compiler Collection (usually shortened to GCC) is a compiler system produced

#include #include #include using std::max;const int MAXF = 1000010;const int MAXN = 110;int n;int base[MAXN], len[MAXN], pos[MAXN];char ans;char f[MAXF];char words[MAXN][MAXN];void solve(){ int idx = 0; for (int i = 0; i

Question link: Click the open link This is a relatively simple state DP with a data volume of 15, so basically there is no need to suspect that this is a state DP problem. This question can reflect the essence of status DP. First, bitwise

Quoit Design Time Limit: 10000/5000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 22349 accepted submission (s): 5735Problem descriptionhave you ever played quoit in a playground? Quoit is a game in which flat rings

Raid Time limit:5000 Ms   Memory limit:65536 K Total submissions:7289   Accepted:2157 DescriptionAfter successive failures in the battles against the union,

A star not a tree? Time limit:1000 ms   Memory limit:65536 K Total submissions:2991   Accepted:1533 DescriptionLuke wants to upgrade his home computer network

Up Time Limit: 4000/2000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 5319 accepted submission (s): 1815The Problem description is a string consisting of lowercase English characters a, B, c... Y, and Z. Evaluate

Count the string Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 3002 accepted submission (s): 1397Problem descriptionit is well known that aekdycoin is good at string problems as well as number

Wooden sticks Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 9018 accepted submission (s): 3680Problem descriptionthere is a pile of N wooden sticks. the length and weight of each stick are

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2141 This question seems to be directly violent, because the data volume seems to be small, but it will increase as soon as the number of violent questions increases. In fact, this

Virus attacks Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 7480 accepted submission (s): 1972Problem description when the light of the sun gradually becomes invisible to the Moon, the world

Various types of files can be saved to the database.   File Table: If exists (select * From DBO. sysobjects where id = object_id (n' [DBO]. [file] ') and objectproperty (ID, n'isusertable') = 1) Drop table [DBO]. [file] Go   Create Table

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3124 When I got this question, I tried to use the method of the closest point on the plane. After a long time, I didn't get any results, but I found this blog post by searching the