Others

/* Two-Dimensional tree array template question */# include # include # include # include using namespace STD; int C [1030] [1030]; int row, Col; inline int lowbit (const Int & X) {return X & (-x);} int sum (int I, Int J) // calculate the sum of

Balanced Lineup Time limit:5000 Ms   Memory limit:65536 K Total submissions:16578   Accepted:7674 Case time limit:2000 ms Description For the daily milking, Farmer John'sNCows (1 ≤N≤ 50,000) always line

This afternoon, I was bored in my entrepreneurship education class. I thought of a Microsoft interview question ~ Number of times 1 appears in N   For example, if n = 11, then 1 appears four times: 1 10 11.   I have been thinking about this issue

DescriptionIt's not surprising that Michael loves skiing because skiing is really exciting. But in order to get the speed, the slide area must be tilted down, and when you slide to the bottom, you have to go uphill again or wait for the elevator to

Question source http://cs.scu.edu.cn/soj/problem.action? Id = 3099 Line Segment tree One operation in the question is to add c to all Members in a certain range; Use d to represent the increment of all elements in the entire interval. # Include

  # Include # include int main () { int n, I; while (scanf ("% d", & n) & n) { for (I = 2; I if (n % I = 0 & (n/= I) printf ("% d", I --); printf ("% d/n", n); } return 0; }     Someone asked me how the program works.   Decompose n into

/* Very bare AC automatic machines, the key is how to remove irrelevant characters in the mode string */# include # include # include # include # include # include using namespace std; const int kind = 26; int ans [1009]; struct node {node *

#include #include #include#include#include#include#include#include#include#includeusing namespace std;const int inf=1= 0 ) Qu[ ++now ] = cur, out[S] = net[cur].next; else break; } int u = net[

Description: Water question, not explained # include # include int num_n [1000], num_m [30], count [30]; int n, m, flag, sum = 1; int main () {// freopen ("a.txt", "r", stdin); while (scanf ("% d", & n )! = EOF) {if (! N) break; for (int I = 0; I

# Include # include # include # include # include # include # include using namespace std; const int MAXN = 255; const int INF = 1000000000; int cap [MAXN] [MAXN], flow [MAXN] [MAXN], low [MAXN] [MAXN], high [MAXN] [MAXN]; // cap [] []

# Include # include # include # include # include # include # include # include # include # include using namespace std; const int N = 100009; const int M = 50009; int n, m, a [N], ans [M]; int hash [N]; map Map; struct point {int a, num,

Description: recursion is applied to recursion. The AC can be used to apply two recursion statements and add a quick row, but an incorrect answer is handed in. Unfortunately, in the first layer of recursion, we only need to recursively follow the

The idea was obtained by Baidu daniu, and the code was self-written (of course the template was used) Q: The Martian wants to compete with the earth, and the Earth spy gets a piece of intelligence: The Martian wants to launch an umbrella and log on

/* Classic topic of "min cut" for the maximum flow: "min cut", but because the min cut is not unique, the question requires a minimum cut condition so that the cut edge can find at least one question similar to usaco, when constructing an edge

Question address: http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 3594 Determine whether a given directed graph meets the requirements. 1. Strongly Connected. 2. Each edge belongs to and belongs to only one ring. The use of the tarjan algorithm uses

Reference: http://hi.baidu.com/%CD%F4%BD%ADwangjiang/blog/item/aa3bc8ec3d549edbb31cb1a3.html Http://apps.hi.baidu.com/share/detail/31832477 Now there is a matrix of n * m. The number in the matrix is unknown, but we know the following constraints:

Struct bit {int c [maxn]; void init () {memset (c, 0, sizeof (c);} int lowbit (int x) {return x & (-x);} void add (int x, int d) {// add d for (; x 0; x-= lowbit (x) ans + = c [x]; return ans;} int getkth1 (int k) {// evaluate the K decimal

Description: In an undirected graph with N points, the path from the edge with numbers 1 to N is obtained, and the points can be intersecting. Solution report: first, find the shortest path, the edges starting from 1 to n are the most

/* The prime number within 10000000 is obviously not feasible; the prime number within 3400 is screened out to detect the number within 10000000, and the number that has been searched is marked with used, if you encounter a mark next time, you will

  Treasure Map Time Limit: 2 seconds Memory limit: 32768 KB Your boss once had got extends copies of a treasure map. unfortunately, all the copies are now broken to your rectangular pieces, and what make it worse, he has lost some of