新月

Problem Description soda has an integer array a1,a2,…,an. Let S(i,j) be the sum of ai,ai+1,…,aj. Now soda wants to know the value below: ∑i=1n∑j=in(⌊log2S(i,j)⌋+1)×(i+j) Note: In this p

Problem Description I've sent Fang Fang around 201314 text messages in almost 5 years. Why can't she make sense of what I mean? ``But Jesus is here!" the priest intoned. ``Show me your messages."

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2653    Accepted Submission(s): 795 Problem Description Harry: "But Hagrid. How am I

Problem Description 福尔摩斯是个大侦探，他总是在解决疑难案件。这一次的案件也不例外，案件是这样的：有编号为1到N的N位嫌疑犯，他们其中有一个犯了罪，然后每个嫌疑犯都被询问,“哪一个人犯了罪？”犯罪嫌疑人的答案只能“编号ai的嫌疑犯犯了罪”或者“编号ai的嫌疑犯没有犯罪”。当然嫌疑犯也可以说他自己（ai = i）. 福尔摩斯凭着他敏锐的侦探直觉，确定地对华生说，只有M个人

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 383    Accepted Submission(s): 167 Problem Description Sequence is beautiful and the

Problem Description CRB has two strings s and t. In each step, CRB can select arbitrary character c of s and insert any character d (d ≠ c) just after it. CRB wants to convert s to t. But i

Problem Description OO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy ai mod aj=0,now OO want to know ∑i=1n∑j=inf(i,j) mod （109+7）.   I

Problem Description There are m soda and today is their birthday. The 1-st soda has prepared n cakes with size 1,2,…,n. Now 1-st soda wants to divide the cakes into m parts so that the

Problem Description There are n soda sitting around a round table. soda are numbered from 1 to n and i-th soda is adjacent to (i+1)-th soda, 1-st soda is adjacent to n-th soda. Each so

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1284    Accepted Submission(s): 221 Problem Description   这依然是关于高富帅小明曾经的故事——   尽管