Others

Question link http://www.codeforces.com/problemset/problem/145/E Good questions A series of strings consisting of 4 and 7 Two operations: Count outputs the longest length of the subsequence within the entire interval without dropping. Switch

Air raid Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 1904 accepted submission (s): 1225 Problem descriptionconsider a town where all the streets are one-way and each street leads from one

# Include Stdio. h > # Include String . H > Int A [ 10001 ]; Bool DP [ 10001 ] [ 101 ]; Int N, m; Int Get_val (){ Int RET ( 0 ); Char C; While (C = Getchar ()) = ' ' | C = ' \ N ' | C = ' \ R '

Alice and Bob Time Limit: 10000/5000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 627 accepted submission (s): 245 Problem descriptionalice and Bob's game never ends. today, they introduce a new game. in this game,

History repeat itself Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 460 accepted submission (s): 223 Problem descriptiontom took the discrete mathematics course in the 2011, but his bad

Pipes Time Limit: 5000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 301 accepted submission (s): 154 Problem descriptionthe construction of office buildings has become a very standardized task. pre-fabricated

  Bit Magic Time limit:8 seconds Memory limit:32768 KB Yesterday, my teacher taught me about bit operators: and (&), or (|), XOR (^ ). I generated a number table A [n], and wrote a program to calculate

Atlanta Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 3469 accepted submission (s): 1549 Problem descriptionthere are several generated ent Greek texts that contain descriptions of the fabled

Increase the capacity for those sides to increase the total traffic. Obviously, adding is useless because it is not the edge of full stream, so it is the edge of full stream that needs to increase the capacity. The method is to find that the

Card collector Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1405 accepted submission (s): 624Special Judge Problem descriptionin your childhood, do you crazy for collecting the beautiful

Food Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 76 accepted submission (s): 47 Problem description you, a part-time dining service worker in your college's dining hall, are now confused

Factorial Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 1699 accepted submission (s): 1085 Problem descriptionthe most important part of a GSM network is so called base transceiver station

  Catching fish Time Limit: 10000/5000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 943 accepted submission (s): 335 Problem descriptionignatius likes catching fish very much. he has a fishnet whose shape is a

  Investment Time limit:1000 ms   Memory limit:30000 K Total submissions:5362   Accepted:1843 Description John never knew he had a grand-uncle, until he got the notary's letter. he learned that

An interesting question Give you a string, and then give you a k pair of Characters It is required to delete some characters so that there is no adjacent character in the string. This is a pair of K pairs.   First, if a character only

Transferred from Http://roba.rushcj.com /? P = 439 Define K-input strings as follows: (1) any string (including empty strings) is 0-input; (2) A return string of N length, if its first n/2 Characters and then n/2 characters are (k-1)-return,

Find Metal Mineral Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission (s): 1441 Accepted Submission (s): 631Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are

Anniversary party Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 2124 Accepted Submission (s): 896Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural

Cow Sorting Time Limit:2000 MS   Memory Limit:65536 K Total Submissions:4753   Accepted:1734 Description Farmer John'sN(1 ≤N≤ 10,000) cows are lined up to be milked in the evening. each cow has a unique

Stockbroker Grapevine Time Limit:1000 MS   Memory Limit:10000 K Total Submissions:21124   Accepted:11474 DescriptionStockbrokers are known to overreact to rumours. you have been contracted to develop a method of