Others

Obtain the return record of the stored procedure SP2 and directly select into to the temporary table: Select * into # T from OpenRowSet ('Sqlodb', 'server = servername; uid = sa; Pwd = 123; database = testdb ','Set fmtonly off; Set nocount on; Exec

Question link: http://poj.org/problem? Id = 1509 This topic is initially thought to be a suffix array, concatenate the same string, and then calculate the rank. I did not expect suchAlgorithm, You can directly find the minimum representation

Calculate the polygon area. This is a simple question. Practice the Polygon Area Method. That is, from the first vertex, the two vertices of the sequential connection order are used to calculate the Triangle Area. There is a problem here. If it is

When creating an item in the DataGrid (itemcreated event), use the attributes attribute to add a confirmation box for the button. Tablecell indicates cells in the table control.1. Deletion columns automatically generated by the systemPrivate void

Reference: http://blog.sina.com.cn/s/blog_7812e98601012cim.html The suffix-based automatic machine is the same as the suffix array. It was very difficult to understand at the beginning. After learning it, I felt that I was very good. Then I was

Question link: http://poj.org/problem? Id = 3368 N ascending arrays are given, and then the query interval is input. The maximum number of identical numbers in the interval must be output. Solution: rmqAlgorithm In fact, how can I use the rmq

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1035 It indicates that this question is very simple and basically there is no trap. As for WA, I did not set the start point to 1 twice, that is, I added 1 more to the start point.

Question link: http://poj.org/problem? Id = 1936 This question is very watery and leaves a footprint # Include # include # include using namespace STD; # define maxn 100010 char first [maxn], second [maxn]; bool find_ans () {int I, j, k;

MSXML provides Microsoft. XMLHTTP objects, which can complete conversion from data packets to request objects and send tasks. The statement for creating an XMLHTTP object is as follows: Set objxml = Createobject (msxml2.xmlhttp) or Set objxml =

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3374 This question is a comprehensive one, and it is not very difficult to do, but at least two O (n) algorithms need to be known, because this question gives 1 million of the data

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1841 It means this question is still interesting. First, analyze the two situations that need to be considered to solve this question. 1. If a string is in another string, the result is

Open-air shopping mballs Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1427 accepted submission (s): 500Problem descriptionthe city of M is a famous shopping city and its open-air shopping

Cupid's arrow Time Limit: 3000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 702 accepted submission (s): 252Problem description it is said that there is an arrow of Cupid in the world. Anyone who has been shot

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4416 I feel that this question is not easy to write, all kinds of errors, and finally refer to the blog program and thought to be completed: http://hi.baidu.com/arosliu/item/ec421c23bf86

Fermat point in quadrangle Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 1460 accepted submission (s): 241Problem descriptionin geometry the Fermat point of a triangle, also called Torricelli

Weapon Time Limit: 3000/1000 MS (Java/others) memory limit: 65535/32768 K (Java/Others)Total submission (s): 144 accepted submission (s): 112Problem description doctor D. are researching for a horrific weapon. the muzzle of the weapon is a circle.

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1496 This topic requires attention to pruning, that is, if the four coefficients are the same number, then the result must be 0. If this pruning is absent, it is likely to time

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1154 First of all, this question involves a lot of knowledge points, and has good ideas and precision requirements. This question requires a little bit of computational ry. It indicates

Analyze the problem and consider the known data structure. Details are very important. # Include # include # include # include # include using namespace STD; // If an array is marked, it is incorrect. For example, for example, 3 1 2 5 4, after

Question link: http://poj.org/problem? Id = 1861 It indicates that this question does not need to be written, because at first glance it is a problem of the Minimum Spanning Tree and it will certainly be able to be written. Later I thought it was