摘要：
Code Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 781 Accepted Submission(s): 287 Problem D 阅读全文
摘要：
利用期望的线性性，等价于计算每个数在集合中的方案数 线性基。先建立一个线性空间b，假设会的到r个基底，这r个基底是线性无关的（就是说，r个基底的数值无论怎么取，异或和都无法得到零），而剩下的n-r个数都可通过这r个基底之间异或得到。 要满足异或和等于0的话，就必须从n-r个数里面考虑。 对于这n-r 阅读全文
摘要：
HDU - 3577 Problem Description Chinese always have the railway tickets problem because of its’ huge amount of passangers and stations. Now goverment n 阅读全文
摘要：
A. Diana and Liana time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output At the first holiday in s 阅读全文
摘要：
Array in the Pocket 部分公式复制不过来http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=4102 Time Limit: 2 Seconds Memory Limit: 65536 KB BaoBao has 阅读全文
摘要：
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 156222 Accepted: 48325 Case Time Limit: 2000MS Description 阅读全文
摘要：
#include<iostream> #include<stdio.h> using namespace std; struct node{ int left,right,value,type; void change(int num) { value = (right - left + 1) * 阅读全文
摘要：
Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 74536 Accepted: 27900 Description In this problem, you have to analyze a pa 阅读全文
摘要：
How Many Answers Are Wrong Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17886 Accepted Submis 阅读全文