2014 年 1月 5 日随笔档案 - Bird.

2014年1月5日

摘要： 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 8 using namespace std; 9 10 template 11 class stack 12 { 13 private: 14 int sum=0; 15 struct node{ 16 T data;struct node *link; 17 }; 18 public: 19 struct node *ttop... 阅读全文

posted @ 2014-01-05 17:20 Bird. 阅读(409) 评论(0) 推荐(0)

Problem C: ChongQueue

摘要： Problem C: ChongQueueTime Limit:3 SecMemory Limit:128 MBSubmit:52Solved:22[Submit][Status][Web Board]DescriptionI solemnly introduce to you a new kind of species ---- bugs (of course not worms on your earth). I am a member of the population. We live in the Chongplanet, which is a well-developed plan 阅读全文

posted @ 2014-01-05 14:34 Bird. 阅读(222) 评论(0) 推荐(0)

Problem G: ZL's Prob.2

摘要： Problem G: ZL's Prob.2Time Limit:1 SecMemory Limit:128 MBSubmit:7Solved:5[Submit][Status][Web Board]Description is coming soon.However we have come across some trouble.The price of one ticket is p. Now there are n clients waiting out for tickets with exact p money in each of them. However, m oth 阅读全文

posted @ 2014-01-05 14:25 Bird. 阅读(136) 评论(0) 推荐(0)

Problem F: ZL's Prob.1

摘要： Problem F: ZL's Prob.1Time Limit:1 SecMemory Limit:128 MBSubmit:33Solved:10[Submit][Status][Web Board]DescriptionIt is said that the Martian are going to have a competition with us.They give us N kinds of different characters(not just letters), and a number K, we have an expression f which is eq 阅读全文

posted @ 2014-01-05 14:21 Bird. 阅读(165) 评论(0) 推荐(0)

Problem B: ChongBit

摘要： Problem B: ChongBitTime Limit:1 SecMemory Limit:128 MBSubmit:42Solved:6[Submit][Status][Web Board]DescriptionConsider you are given a 32-bit unsigned integer N. You have to find a mask M such that L ≤ M ≤ R and N OR M is maximum. For example, if N is 100 and L = 50, R = 60 then M will be 59 and N OR 阅读全文

posted @ 2014-01-05 14:04 Bird. 阅读(139) 评论(0) 推荐(0)