Others

We soon discovered the recurrence feature of this question. It's naked ~ Define an array ([String Length] [number of '1' in the string] = number of types). This is an arrangement ~ C (n, I) = C (n-1, I) + C (n-1, I-1) is obtained by using a

So... enter to test my skills... Okay, I am not sorry ~ Wow, haha ~ # Include # include # include # define Mn 111 using namespace STD; int N, F, E, D, ANS, S, T; int map [Mn] [Mn], que [Mn], a [Mn], vis [Mn], pre [Mn]; void setg () {int I, U,

The question of this question is very difficult... Although it is a very obvious binary question. K cows numbered 1-K and C cows numbered k + 1-K + C form a distance matrix of K + C. Each dairy machine can handle T cows At the beginning... only

Network Flow Problems: The general idea of this question is as follows: There are m pigtails (m ≤ 1000), and each pigsty initially has several pig heads. All pigsty links are closed at the beginning. There are N Customers (n ≤ 100)

The largest naked network stream... there is no skill in creating a graph... continue to the water... # Include # include # include # define Mn 444 using namespace STD; int S, T, ANS, W [8], sum; int map [Mn] [Mn], vis [Mn], a [Mn], pre [Mn],

After thinking for a long time, I had an epiphany after reading the question! The principle of the game is used naked, but the status is recorded using the DP Method. There are many gains. /* ID: bysenLANG: C ++ PROG: game1 */# include using

Think about DP .... # Include # include # include # include using namespace std; int f [2222] [2222]; int min (int, int B) {return a

I think the code is quite correct. I handed it in to TLE. I thought my method was wrong. I thought from last night, what was wrong? I saw the acquaintance code last night, but it was still awesome. Most of the solutions on the Internet are positive

B-Travel By AirlineTime Limit: 3000/1000 ms (Java/Other) Memory Limit: 65535/32768 K (Java/Other) Total Submission (s): 24 Accepted Submission (s): 1 Font: times New Roman | Verdana | GeorgiaFont Size: Drawing → Problem DescriptionYou have won a

Refresh !! Today, we have registered a small account and a freshman student to answer questions;I don't mean to compete with them, but I am not familiar with many algorithms, so I have to answer a few questions with my account, and I have to answer

It is found that it is better to cut the question as long as you have ideas. I believe everyone will not be surprised. The matrix below is still well constructed. The row 0th represents a robot with the grid number 0th. It can be seen that the grid

Amazing 4720msAC .... It seems that double is not generally slow !! Alas ~ #include#include#include#include#define eps 1e-5using namespace std;struct node{double m[222][222];}res,temp,mod;int n,m,t;node matriXmult( node a,node b ){ node c; memset(

Question: There are N people with Ai tags in their hands. This person can add tags to the specified K people (his/her own tags will not be less ). A person with an odd number of tags has the right to vote. The number of tickets in the last ticket is

I have brushed a lot of matrix questions over the past few days, and I feel a lot of training for my thinking. I have never liked to do so. I have been amazed by Guo's cooking these days... Follow up with questions! Question: There is a row of

After reading the network stream for three days, I finally cut off a question... We still need to calm down, be patient, and be confident ~~ Hey hey ~ #include#include#includeusing namespace std;struct edge{int f,c;}g[222][222];struct node{int

How did I figure this question when I was lying in bed last night .... At the beginning, I thought that the traffic from the source point to the ox was 2 (only one drink for the ox is allowed ). In addition, the dual-edge can be directly connected

[Topic] There is a one-dimensional ridge with FJ cattle on the ridge, and each ox has its own territory [Si, Ei]. If [Si, Ei] is included in [Sj, Ej] and is not completely equal. Then J Niu is stronger than I Niu. Now FJ wants to know how many cows

Old Dai finds... This question is still very interesting... haha ~ I thought about it for a long time... but it seems a bit wrong when I am not doing this! This can also be AC ?? I don't believe it !! The edge of the network stream cannot be easily

The technique for this is: enumeration-rotating the card shell method. Question: Each ox has a liking for each barn. FJ aims to keep the happy value of each ox as identical as possible and to obtain the minimum range. The enumeration of this

Question: Someone has a lot of gems, various colors and shapes. The person has the power to change the gem and make it change a color and shape. The man wants to send the gem to his girlfriend. He has an upper limit on each shape of the gem and an