C++

C. Vasily the Bear and SequenceTime limit per test2 secondsMemory limit per test256 megabytesInputstandard inputOutputstandard outputVasily the bear has got a sequence of positive integers a1, clerk a2, clerk ,..., your. vasily the Bear wants to

Question:The start position is 0. Each step can be left or not moved to the right. After n steps are taken, the path can reach the rightmost expectation. Solution: During the competition, the question was wrong and thought it was necessary to return

The weight and value of n items are w [I] and v [I] respectively, and K items are selected to maximize the value of unit weight. 1 1 The general idea is to sort items by unit value, and then select items by greedy, but this method is incorrect and

Corn FieldsTime Limit: 2000 MS Memory Limit: 65536 KTotal Submissions: 5221 Accepted: 2769 Description Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. he wants to grow some yummy

# Include # include # include # include using namespace std; int nu [10000]; int main () {int n, I, k, p; char in [1000], out [1000]; while (scanf ("% d", & n )! = EOF) {memset (nu, 0, sizeof (nu); stack s; cin> in> out; k = I = p = 0; while (I

// Base class: # include class Animal () {public: Animal (int height, int weight) {cout  

Digit dp, dp [I] [j] indicates the total number of j numbers ranging from 1 to I, and then counts by bit.   #include #include #include #include using namespace std;int dp[10][10];int pow(int a,int b){ int ret=1; for(int i=1;i=1;i--) {

A very simple question, step by step. Going out of the matrix indicates that there is no ring. If you go to a place that has already passed, it indicates that there is a ring. You can output the result in the format !!! # Include # include int n,

The question is as follows: In a two-dimensional coordinate system, there are n cities and the coordinates are given, and then p soldiers are going to occupy the n cities, but there are m roadblocks on the road, all of which are line segments,

For machine scheduling problems, the same task can be completed in different modes on two different machines, A and B. the initial mode of the machine is mode_0, but changing from any mode to another mode requires restarting the machine. the minimum

HH. You can only worship it all the time... Starting from the line tree, he learned 1.1 drops from his blog. The style is also based on him. Then let's talk about the question. There will be a lot of monster attacks, and then there will be N heroes.

I. Usage and implementation of strcpy functions:[Cpp]/* Implementation in GNU-C (excerpt ): */ Char * strcpy (char * d, const char * s) { Char * r = d; While (* d ++ = * s ++ )); Return r; } /* Implementation in GNU-C (excerpt ): */ Char * strcpy

Given n vertices, n-1-1 rows of u, v, and dis indicate an undirected edge and edge weight. Here a undirected tree is given. The following m indicates m queries. Ask u v n, which is the shortest distance. Typical conversion from LCA to RMQ     #

Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 8274 Accepted Submission (s): 4860   Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting

// File Name: hdu1_6.cpp // Author: bo_jwolf // Created Time: friday, August 16, 2013, # include # include # include # include # include # include # include # include # include # include # include # include # include # include #

Question: Given a matrix, only 1X2 blocks can be placed, and how many different la s can be completely covered by this matrix. Analysis: If the value is 11 and 01 is vertical, you only need to determine whether the State collection (j | k) of the

Description Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually failed CT the contest result satisfy the following two terms:1. All of the teams solve at least one problem.2. The

# Include # include # include using namespace std; const int maxn = 222222; int son [2] [maxn], col [maxn], fa [maxn], size [maxn], val [maxn]; int tot; int num [maxn]; void new_node () {size [tot] = 1; fa [tot] = son [0] [tot] = son [1] [tot] =-1;

Question: Spread rumors between stock brokers. Give a contact network for stock brokers: w when a is connected to B. Q: which one can be used as the source of the rumor to make rumor spread to everyone the fastest, and the time it takes to reach

A tree with n knots starts from 0 (root node), Alice and Bob go from 0 to the leaf node, Alice goes through the shortest path, and Bob goes through the longest path, bob first selects the next node, then the two come together to that node, then