Others

  Course Selection time (the question has been modified. Read the question) Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 995 accepted submission (s): 836 The time for selecting the course

When a given string is any character, can such a prefix be expressed as a substring through at least two cycles. In the example, "AAA" indicates that the result can be obtained twice in the second position, the loop section is "a" of course, and the

The topological sorting of this question must be handled by retrieving all the points that can pop out in a loop, and then adding one based on the basic salary. CodeAs follows: # Include # include # include typedef struct a {int sign; struct a

Determine competition rankings Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 3141 accepted submission (s): 1128Problem description has N teams (1 Name, but now the referee committee can not

the nasty simulation question is not counted as the first step. It has contributed a lot of WA resources. If you pay attention to this, there should be no problem. # Include # include # include using namespace STD; int n, m, Sx, Sy; char map [15]

Sort again Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1395 accepted submission (s): 448Problem description Give you n integers, X1, x2. .. XN, any two integers are combined to get | Xi-XJ |,

1560: the least palindromic number Time Limit: 1 sec memory limit: 128 MBSubmit: 111 solved: 15[Submit] [Status] [web board] Description Palindromic numbers are digital strings that read the same bothForwards and backwards. For example, 121, 44

DNA sorting Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 854 accepted submission (s): 442Problem description One Measure of ''unsorteds'' in a sequence is the number of pairs Entries that are

ACM rank table Time limit:1000 ms Memory limit:65536 K Total submissions:2979 Accepted:764 DescriptionACM Contests, like the one you are participating in, are hosted by Special software. That software, among

Search for words Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1267 accepted submission (s): 914 Problem description assume there are x1 letters A and X2 letters B ,..... assume that the value

1558: Count cycles Time Limit: 1 sec memory limit: 128 MBSubmit: 84 solved: 21[Submit] [Status] [web board] Description In information theory, a low-density parity-check (parity check) code is a linear error correcting code, a method of

Very cola Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1190 accepted submission (s): 500Problem description Large It is a pleasant thing for you to drink Cola after exercise, but seeyou does

Double Queue Time limit:1000 ms Memory limit:65536 K Total submissions:4628 Accepted:2130 Description TheNew founded Balkan Investment Group Bank (big-bank) opened a new officeIn Bucharest, equipped with a

I am here Time limit (Common/Java): 1000 ms/3000 Ms running memory limit: 65536 Kbyte Total submission: 17 tested: 9 Description There is such a prime number called a pure prime number (the name given by YY). When it is a multi-digit number, the

Sorttime limit: 3000/1000 ms (Java/other) memory limit: 65535/32768 K (Java/other) total submission (s): 8 accepted submission (s): 3 Font: times New Roman | verdana | georgiafont size: tables → problem descriptionas is known to all, long ago

The question is given a very huge string, and then many pattern strings are given for matching. If KMP is used, the parent string will be scanned many times, which will time out. The AC automatic machine is an optimization for multi-String Matching.

Serialization Time Limit: 20000/10000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 5613 accepted submission (s): 1455Problem description "Connection I believe many people have played this game. It doesn't matter if

Accepted neck.pdf Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1027 accepted submission (s): 407Problem description I Have n precious stones, and plan to use K of them to make a neck.pdf For

  Immediate decodability An encoding of a set of symbols is said to beImmediatelyDecodable If no code for one symbol is the prefix of a code for another symbol. we will assume for this problem that all codes are in

Here we mainly preview prime filtering and writing of input plug-ins. Tao Shen's NLP has always been remembered to be awesome. 　　 #include #include #include using namespace std;char hash[16005] = {0};bool getint( int &t ){char c; int f = 1;while( c