Veritas des Liberty

摘要： A. The Meaningless Game time limit per test：1 second memory limit per test：256 megabytes input：standard input output：standard output Slastyona and her 阅读全文

摘要： /*堆排序(大顶堆)*/ #include #include using namespace std; void HeapAdjust(int *a,int i,int size) //调整堆 { int lchild=2*i; //i的左孩子节点序号 int rchild=2*i+1; //i的右孩子节点序号 int max=... 阅读全文

摘要： 1 #include<iostream> 2 using namespace std; 3 4 #define N 100 5 6 int g_array[N]; //存放输入的数字 7 static int count; //存放元素的个数 8 9 //初始化函数 10 void Initial( 阅读全文

摘要： #include<stdio.h>#include<math.h>#define M 10^5+10int p[1000000],a[10000001],t=0;int prime(int n){ int i,q; q=(int)sqrt(n); for(i=0;p[i]<=q&&t;i++) if 阅读全文

摘要： You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible numb 阅读全文

摘要： C - Maximum of Maximums of Minimums You are given an array a1, a2, ..., an consisting of n integers, and an integer k. You have to split the array int 阅读全文

摘要： Chat Order Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description Polycarp is a big lover of killing time in 阅读全文

摘要： 统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 39360 Accepted Submission(s): 14317 Problem 阅读全文

摘要： Matrix Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2650 Accepted Submission(s): 1411 Problem 阅读全文

摘要： POJ 1330 Nearest Common Ancestors A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the 阅读全文