Others

# Include # include char * sum (char * a, char * B); void main () {int N; char a [1005], B [1005]; scanf ("% d", & N); For (INT I = 1; I = 0 & I> = 0) {C [bit] = (a [I] + B [J] + tag-96) % 10 + 48; tag = (a [I] + B [J] + tag-96)/10; bit --; I --;

It is easy to understand the characteristics of the Chinese character machine internal code. The description of the Chinese character internal code expression in the computer is that two bytes are used, and each byte has the highest bit of 1.In the

Bare matrix multiplication and rapid matrix power Below isCode: # Include # include # define maxn 1010int A, B, n; struct node {int M [2] [2]; void Init () {memset (M, 0, sizeof (M) ;}} a, B; node martix_mul (node A, Node B) {node temp; temp.

When a person is skiing down, the longest length of skiing is required. Idea: d [I] [J] = max {DP [I-1] [J] + 1, DP [I + 1] [J] + 1, DP [I] [J-1] + 1, DP [I] [J + 1] + 1}, of course to meet some basic conditions: high and low. here is the use of

// Hartals (strike) // PC/ultraviolet A IDs: 110203/10050, popularity: B, success rate: high level: 2 // verdict: accepted // submission date: 2011-05-23 // UV Run Time: 0.012 S // copyright (c) 2011, Qiu. Metaphysis # Yeah dot net // obtain the

# Include using namespace STD; bool prime (int x) {// The prime function checks whether a number is a prime number for (INT I = 2; I * I

// File fragmentation (File fragmentation) // PC/Ultraviolet IDs: 110306/10132, popularity: C, success rate: average level: 2 // verdict: accepted // submission date: 2011-05-19 // UV Run Time: 0.012 S // copyright (c) 2011, Qiu. Metaphysis # Yeah

It is not difficult to find the rule. Basic Idea: Note that the number of diagonal lines in the center is regular. Enter N, and then start from the number on the diagonal line according to n. Note that the parity of the x-axis on the diagonal

This is obviously a split point. But where is it? When I was doing this, I split the beef. The Food and water I split today were definitely wrong. According to my graph creation method, S connected to the ox, the ox connected to the water, the water

// Vito's Family (Vito Family) // PC/Ultraviolet IDs: 110401/10041, Popularity: A, Success rate: high Level: 1 // Verdict: Accepted // Submission Date: 2011-05-21 // ultraviolet A Run Time: 0.104 s /// copyright (C) 2011, Qiu. Metaphysis # yeah dot

// Common Permutation (Public arrangement) // PC/Ultraviolet IDs: 110303/10252, Popularity: A, Success rate: average Level: 1 // Verdict: Accepted // Submission Date: 2011-05-22 // UV Run Time: 0.044 s // copyright (C) 2011, Qiu. Metaphysis # yeah

First, calculate the area and volume without π. In fact, the code that does not remove branches is still very easy to write: // M indicates the number of layers of the cake. // v indicates the size of the currently coated. // s indicates the size of

// WERTYU (WERTYU keyboard) // PC/Ultraviolet IDs: 110301/10082, Popularity: A, Success rate: high Level: 1 // Verdict: Accepted // Submission Date: 2011-05-17 // UV Run Time: 0.012 s // copyright (C) 2011, Qiu. Metaphysis # yeah dot net # include

This question is not described as a case-insensitive question, so it took more than half an hour to get the question. Success! The following code describes the question of the AC automatic machine: #include#include#include#includeusing namespace std;

Problem G Doves and Bombs Input:Standard Input Output:Standard Output Time Limit:2 Seconds It is the year 95 ACM (After the Crash of Microsoft ). after using years of peace, a war has broken out. your nation, the island of Evergreen Macros And

Document directory Sample Input Sample Output Problem C: Arctic Network The Department of National Defense (DND) wishes to connect several northern outposts by a wireless network. two different communication technologies are to be used in

// Interpreter (Interpreter) // PC/ultraviolet A IDs: 110106/10033, Popularity: B, Success rate: low Level: 2 // Verdict: Accepted // Submission Date: 2011-04-09 // UV Run Time: 0.008 s // copyright (C) 2011, Qiu. Metaphysis # yeah dot net //

Use mathematical formulas: The number of planes of n straight lines is n * (n + 1)/2 + 1. Each line can be regarded as two straight lines. Therefore, the number of planes is 2 * n * (2 * n + 1)/2 + 1, and the number of planes for each line is

I am using A stupid method. Library functions should be availableStrchr ()But I tried several times and failed to solve the problem. Therefore, this is more conservative and secure. Note that A, F, K, 4 ....... A single character is a return string,

Sliding Window Time Limit:12000 MS   Memory Limit:65536 K Total Submissions:32104   Accepted:9528 Case Time Limit:5000 MS DescriptionAn array of size N≤ 106 is given to you. There is a sliding window of