Others

HDU-1427-24 o'clock Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1427 4. The number is calculated as 24 through +,-, *,/, and parentheses, Enumerate the numbers and operators, and use DFS. Note that decimal numbers are not allowed during

HDU-2577-How to type Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2577 An interesting question: Give a set of strings and ask how many times the keyboard can be completed. Lowercase letters can be played when capslock is not on, or when

HDU-2612-Find a way Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2612 Calculate the sum of the distance between the two points and KFC to minimize it. Use BFS twice to obtain the shortest distance between the two points and each KFC, and

HDU-4068-SanguoSHA Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4068 String simulation, enumerating the full arrangement of your own and your opponent's cards # Include # include # include # include using namespace STD; int map [10] [1

HDU-1244-Oil (deposits) Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1241 Basic DFS # Include # include # include char map [105] [105]; int n, m; int dir [8] [2] = {-1,-1 }, {-}, {0,-1}, {}, {1,-1}, {}, {}; int go (int x, int y) {If (0

POJ-2488-A Knight's journey Http://poj.org/problem? Id = 2488 For a board of N1 * N2, starting from (0, 0), can we traverse all vertices without repeating each day? Use DFS. Note that the search direction should be lexicographically #

POJ-3259-Wormholes Http://poj.org/problem? Id = 3259 Bellman_ford determines whether a negative ring exists # Include # include # include # include using namespace STD; # define Max 0x7fffffffstruct edge {int X, Y, V ;} edge [6000]; int

The downloaded JDK is an executable Installer. Double-click to install it. Change the installation path to C: \ jdk1.6.0 (other paths can also be used ). After JDK is installed, set JDK environment variables: Right-click my computer, select

HDU-1394-Minimum Inversion Number Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1394 The meaning is to give n numbers, calculate their reverse order number, and move the first number to the end each time, then calculate its reverse order number,

Https://projecteuler.net/problem=4 1. It is the number of replies 2. There are two three-digit product equal to it. 1 # include 2 # include 3 using namespace std; 4 bool is_ OK (int x) 5 {6 if (x % 10! = X/100000 | (x/10) % 10! = (X/10000) % 10

POJ-3126-Prime Path Http://poj.org/problem? Id = 3126 Add BFS to a table with prime numbers # Include # include # include # include # include using namespace std; # define N 10005int prime [10005]; int visit [N]; struct node {int x; int step ;}

HDU-1698-Just a Hook Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1698 Or segment update line segment tree #include#include#include#define N 100005struct cam{int x;int y;int sum;int val;}list[N*4];void build(int k,int x,int y){int

HDU-1596-find the safest road Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1596 SPFA Algorithm # Include # include # include using namespace std; int n, m, st, ed, front, rear; double mat [1005] [1005], dis [1005]; int v [1005], q [1000001

HDU-1754-I (Hate It) Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1754 The maximum value of the query interval, which can be updated. The line segment tree can be a line segment tree with a range of [1, 5 ]. # Include # include # include #

HDU-4107-Gangster Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 4107 Segment generation update of a line segment tree. This topic can record the maximum and minimum values of an interval. If the maximum value of an interval is smaller than p, the

HDU-1598-find the most comfortable road Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1598 And check the collection and greedy #include#include#include#includeusing namespace std;#define N 1010#define INF 0x7fffffffstruct cam{int st,ed;int speed;}

HDU-3397-Sequence operation Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 3397 Line Segment tree, multiple operations on the interval # Include # include # include # include using namespace std; # define N 100010 struct cam {int x; int y; int

HDU-3635-Dragon bils Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 3635 Check the set, and compress the path to update the number of transfers. # Include # include # include # include using namespace std; # define N 10005 struct cam {int f;

HDU-2846-Repository Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 2846 The question is to give some mode strings, then give a few more inquiries, and ask how many mode strings the given string appears in. For example, the strings abc contain a, AB,

POJ-2528-Mayor's posters Http://poj.org/problem? Id = 2528 The discretization of the Line Segment tree is equivalent to first ing and then building Test data for the question 1 4 2 6 8 10 3 4 7 10 Extracts and sorts the endpoints, and removes the