上一页 1 ··· 39 40 41 42 43 44 45 46 47 ··· 53 下一页
摘要: I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10672 Accepted Submission(s): 4019Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要 阅读全文
posted @ 2013-01-08 16:48 剑不飞 阅读(125) 评论(0) 推荐(0) 编辑
摘要: Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4637 Accepted Submission(s): 2388Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, 阅读全文
posted @ 2013-01-08 15:19 剑不飞 阅读(142) 评论(0) 推荐(0) 编辑
摘要: DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10438 Accepted Submission(s): 2918Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the 阅读全文
posted @ 2013-01-08 12:24 剑不飞 阅读(139) 评论(0) 推荐(0) 编辑
摘要: A GameIOI'96 - Day 1 Consider the following two-player game played with a sequence of N positive integers (2 #include using namespace std; ifstream cin("game1.in"); ofstream cout("game1.out"); const int mm=1000; int f[mm][mm],sum[mm][mm]; int shu[mm]; int main() { int n; whil 阅读全文
posted @ 2013-01-07 20:32 剑不飞 阅读(298) 评论(0) 推荐(0) 编辑
摘要: Home on the RangeFarmer John grazes his cows on a large, square field N (2 = 2x2) remaining. Of course, grazing areas may overlap for purposes of this report.PROGRAM NAME: rangeINPUT FORMATLine 1:N, the number of miles on each side of the field.Line 2..N+1:N characters with no spaces. 0 represents & 阅读全文
posted @ 2013-01-06 11:52 剑不飞 阅读(195) 评论(0) 推荐(0) 编辑
摘要: CamelotIOI 98 Centuries ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to celebrate their fellowship. In remembrance of these events, we consider a board game for one player, on which one chesspiece king and several knight pieces are placed on squar 阅读全文
posted @ 2013-01-05 14:31 剑不飞 阅读(446) 评论(0) 推荐(0) 编辑
摘要: C++ Priority Queue(优先队列)C++优先队列类似队列,但是在这个数据结构中的元素按照一定的断言排列有序。它的头文件为。由于适配器不支持迭代,一个 priority_queue 将有没有关联的迭代器。函数列表:empty() 如果优先队列为空,则返回真 pop() 删除第一个元素 push() 加入一个元素 size() 返回优先队列中拥有的元素的个数 top() 返回优先队列中有最高优先级的元素 /////////////////////////////////////////////////////////////////////////////////////构造函数ex 阅读全文
posted @ 2012-11-30 16:08 剑不飞 阅读(237) 评论(0) 推荐(0) 编辑
摘要: 声明为pair类型的变量可以有三种赋值方法:1. 通过初始化赋值 直接声明的时候 后面加括号并且数据,如下a2. 通过.first .second 来赋值 如下b3. 通过 = make_pair() 来赋值, 如下c a. pair product1 ("tomatoes",3.25); pair product2; pair product3; b. product2.first = "lightbulbs"; // type of first is string product2.second = 0.99; // type of second i 阅读全文
posted @ 2012-11-29 20:09 剑不飞 阅读(651) 评论(0) 推荐(0) 编辑
摘要: H. Queries for Number of Palindromestime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got a string s = s1s2...s|s| of length|s|, consisting of lowercase English letters. There also areq queries, each query is described by two integersli, 阅读全文
posted @ 2012-11-24 21:38 剑不飞 阅读(202) 评论(0) 推荐(1) 编辑
摘要: Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17227 Accepted Submission(s): 7705Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data 阅读全文
posted @ 2012-11-24 19:34 剑不飞 阅读(176) 评论(0) 推荐(0) 编辑
上一页 1 ··· 39 40 41 42 43 44 45 46 47 ··· 53 下一页