Others

Http://acm.sdut.edu.cn/sdutoj/problem.php? Action = showproblem & problemid = 2100 # Include # include # include using namespace STD; int main () {priority_queue , greater q; int N, A1, A2, A3; int sum = 0; scanf ("% d", & N); For (INT I = 1;

For the first ACM training, I want to write my own experiences and feelings and share them with you. In January 18, 2013, I started my training journey... On the first day, I was physically and mentally exhausted and abused, but I insisted on

Link: http://acm.hdu.edu.cn/showproblem.php? PID = 2544 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 29015 # Problem/A Short Circuit Time Limit: 5000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 22

Question: Evaluate the number of integers between 1 and N that contain 13 and can be divisible by 13. Ideas: Digit DP. Note that the remainder must be recorded in the condition of division, that is, the modulus. # Include # include using

Enumeration entry. Original question link: http://poj.org/problem? Id = 2029 poj Http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemid = 716 zoj Get started persimmon trees Time limit:1000 ms   Memory limit:30000 K

HDU today Time Limit: 15000/5000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 9623 accepted submission (s): 2297With the help of Problem description, Haidong Group has finally passed the crisis. Since then, HDU has

Link: http://poj.org/problem? Id = 1860 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 22010 # Problem/acurrency exchange Time limit:1000 ms   Memory limit:30000 K Total submissions:16244   Accepted:5656

This is a typical map, but you can also use a dictionary tree and a binary tree for sorting. You have just moved from Waterloo to a big city. the people here speak an incomprehensible dialect of a foreign language. fortunately, you have a dictionary

This question is a variety of sorrows. At the beginning, I wanted to mark the elements in the graph with a three-dimensional array, but it was very troublesome to implement it. Later I used a two-dimensional array to store it, we can use vertices to

Link: http://acm.hdu.edu.cn/showproblem.php? PID = 2152 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 28708 # Problem/efruit Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 2632

Link: http://acm.hdu.edu.cn/showproblem.php? PID = 3665 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 29015 # Problem/cseaside Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 944

DP (Er, there is no cross-cutting path between the two sides ...) Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1025 Constructing roads in jgshining's kingdom Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K

Link: http://acm.hdu.edu.cn/showproblem.php? PID = 1869 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 29015 # Problem/d6-degree Separation Time Limit: 5000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s)

Link: http://acm.hdu.edu.cn/showproblem.php? PID = 1541 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 28619 # Problem/cstars Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 3474

Link: http://poj.org/problem? Id = 1050 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 28508 # Problem/BTO the max Time limit:1000 ms   Memory limit:10000 K Total submissions:36968   Accepted:19480

The suspects Time limit:1000 ms   Memory limit:20000 K Total submissions:17149   Accepted:8272 DescriptionSevere Acute Respiratory Syndrome (SARS), an atypical ppneumonia onia of unknown aetiology, was recognized

Over the past few days, I have found my own learning method: I will not write the complete code according to the algorithm. I learned the Dijkstra algorithm today and understood it myself, that is, I cannot write the complete code. Think about what

Link: http://poj.org/problem? Id = 2253 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 22010 # Problem/dfrogger Time limit:1000 ms   Memory limit:65536 K Total submissions:21206   Accepted:6903

This is a typical problem of the minimal spanning tree, which gives the distance between cities, then find the smallest edge in the minimal spanning tree, and use pirme to add a correction to make it easy to pass through ,,, I have heard from my

Let's not talk about it much. Typical minimal spanning tree ,,, Agri-Net Time limit:1000 ms   Memory limit:10000 K Total submissions:33507   Accepted:13416 DescriptionFarmer John has been elected mayor of his town!