C++

Problem DescriptionA while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. then one day my grandmother suggested I tried counting sheep after I 'd gone to bed. as always when my grandmother suggests

The system learns graph theory once! Start with this blog! First, introduce some concepts. Undirected graph: G is a connected undirected graph, and the path that passes through each edge of G once and only once is Euler's path. If the Euler path is

Question meaning:There are n jobs, each of which has a deadline. If each job has a penalty value when it is completed by the deadline, ask how to arrange the job to minimize the penalty value. Solution: Greedy. First, sort by the penalty value from

// Send via serial port   Void sendChar (char * p) // call the front-off is interrupted. After the call is completed, the center is disconnected {while (* p! = '\ 0') {SBUF = * P while (! TI); TI = 0; p ++ ;}} void sendChar (char * p) // call the

There are N computers with M blank borders between them. Then, I asked how many bridges are there each time I add an edge between them.   Thought: in fact, this question does not need to be reduced .. Directly record the location of each bridge, and

# Include # Define uint unsigned int# Define uchar unsigned charUchar code f [] = {0x3f, 0x06, 0x5b, 0x4f, 0x66, 0x6d, 0x7d, 0x07, 0x7f, 0x6f };Sbit wela = P1 ^ 1;Sbit dula = P1 ^ 0;Sbit jian = P2 ^ 4;Sbit jian2 = P2 ^ 5;Uchar a = 0, B = 0, c;Uchar

This topic is used to calculate the maximum number of repeated numbers in an interval. This topic has a special feature. Numbers are incremental, and the same numbers must be continuous. Consider the same number as a part and use hash to save the

Dp [x] [y] indicates that the subtree rooted in x must have y points .. edge tree to be subtracted at least... eventually ans = max (dp [I] [P] + t) There are two types of updates .. one is to transfer it from the child... enumeration to do 01

  This question has been done since last night. It has been done for now. It is too pitfall. After reading this, other people know that the enumeration can be violent, and then there are various small mistakes, Ah ...... The string functions in C

/*s[b+1]-s[a]>=cs[i+1]-s[i]>=0s[i]-s[i+1]>=-1*/#include#include#include#include#includeusing namespace std;#define maxn 50005struct node{ int v,w,next;}edge[maxn Q; memset(in,0,sizeof(in)); memset(d,-0x3f,sizeof(int)*(end+5)); Q.push(0);

Definition Only linear tables that are inserted and deleted at the end of the table are allowed. (First in and then out) Sequential Structure C Definition[Cpp]# Define MAXSIZE 20 # Pragma mark sequential Stack Typedef int SElemType;Typedef struct

The principle is a ^ B % n = d; >>>>>> (a % n) × ........ * (a % n) % n = d Then when n = 1 or n % 2 = 0, d must be 0, so there is no solution at this time; When n is another value, it must be 1 ~ The remainder of n-1 exists. Therefore, use the

Description: Enter Two integer sequences. the first sequence indicates the order in which the stack is pushed. Determine whether the second sequence is in the pop-up order of the stack. Assume that all numbers pushed into the stack are not equal.

# Include # include # include # include # include # include # include # include using namespace std; long up [25] [25]; long down [25] [25]; long ans [25]; void getfirst (long n, long c, bool u) {if (n = 0) return; long sum = 0, t; if (! U) {

I. Overview   Priority_queue. First, it is a queue, that is, only elements can be added at the low end and elements can be retrieved from the top. There is no other way to access elements (therefore, priority_queue does not provide the traversal

The question provides a series of numbers, and then asks which number is ranked in the ascending order. Repeat the number to calculate the first number. The data range is 10000, which is not large and can be completely violent. sort will not time

Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 25799 Accepted Submission (s): 8421 Problem DescriptionIn the modern time, Search engine came into the life of everybody like Google,

// ------ When Fcpu = 32 m, filter rate setting ------------ # defineUART_RATE_1200 (uint16) 6661 # average (uint16) 3331 # average (uint16) 1666 # define (uint16) 833 # defineUART_RATE_19200 (uint16) 417 //************************************* //

Clairewd's messageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 2512 Accepted Submission (s): 983   Problem DescriptionClairewd is a member of FBI. after several years concealing in BUPT, she

Notes:When a pointer is passed as a function parameter, it is essentially a "value transfer", that is, a new pointer variable pointing to the address is copied. Only when the pointer is referenced in the called function can the variable pointed to