摘要： A family of nn gnomes likes to line up for a group picture. Each gnome can be uniquely identified by a number 1..n1..n written on their hat. Suppose t 阅读全文

摘要： Consider an n \times mn×m matrix of ones and zeros. For example, this 4 \times 44×4: \displaystyle \begin{matrix} 1 & 1 & 1 & 1 \\ 0 & 1 & 1 & 1 \\ 0 阅读全文

摘要： D. Vasya And The Matrix time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Vasya And The 阅读全文

摘要： int n; int main() { scanf("%d",&n); cout>b == a/(2^b） &&还具有短路的功能，即如果第一个表达式为false，则不再计算第二个表达式 int a[5]; char c ='d'; for(int i=0;i<4;i++) a[i]=i; for(int i=0;i<... 阅读全文

摘要： Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1196 Accepted: 783 Description The classic Two Glass Balls brain-teaser is often pose 阅读全文

摘要： Consider nn initial strings of lower case letters, where no initial string is a prefix of any other initial string. Now, consider choosing kk of the s 阅读全文

摘要： p1m2 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 925 Accepted Submission(s): 351 Problem De 阅读全文

摘要： Recently, Bob has just learnt a naive sorting algorithm: merge sort. Now, Bob receives a task from Alice.Alice will give Bob N sorted sequences, and t 阅读全文

摘要： C. Elections time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Elections time limit per 阅读全文

摘要： 1 如果 x>0&&x&(x-1)==0 那么x为2的指数幂 0&（-1）==0 阅读全文