remarkableyan的博客

Maximum Multiple Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 967    Accepted Submission(s): 445   Problem Description Given an integer n...

Distinct Values Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3336    Accepted Submission(s): 523   Problem Description Chiaki has an arra...

Balanced Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3097    Accepted Submission(s): 795   Problem Description Chiaki has n str...

5. Eddy likes to play with string which is a sequence of characters. One day, Eddy has played with a string S for a long time and wonders how could make it more enjoyable. Eddy comes up with following...

  链接：https://www.nowcoder.com/acm/contest/145/J 来源：牛客网   You have a n * m grid of characters, where each character is an English letter (lowercase or uppercase, which means there are a total of 52 ...

 A binary string s of length N = 2 n is given. You will perform the following operation n times : - Choose one of the operators AND (&), OR (|) or XOR (^). Suppose the current string is S = s 1 s ...

标题：E、Touring cities | 时间限制：2秒 | 内存限制：256M Niuniu wants to tour the cities in Moe country. Moe country has a total of n*m cities. The positions of the cities form a grid with n rows and m columns. We ...

Werewolf Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 367    Accepted Submission(s): 58   Problem Description "The Werewolves" is a pop...