摘要：
Easy Problem from Rujia Liu?Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasionally sets easy problem (for example, 'the Coco-Cola Store&# 阅读全文
posted @ 2013-07-19 23:06
贾树丙
阅读(456)
评论(1)
推荐(0)
摘要：
I Can Guess the Data Structure!There is a bag-like data structure, supporting two operations:1 xThrow an element x into the bag.2Take out an element from the bag.Given a sequence of operations with return values, you're going to guess the data structure. It is a stack (Last-In, First-Out), a que 阅读全文
posted @ 2013-07-19 22:44
贾树丙
阅读(458)
评论(1)
推荐(0)
摘要：
strcmp() Anyone?strcmp() is a library function in C/C++ which compares two strings. It takes two strings as input parameter and decides which one is lexicographically larger or smaller: If the first string is greater then it returns a positive value, if the second string is greater it returns a nega 阅读全文
posted @ 2013-07-19 22:24
贾树丙
阅读(446)
评论(1)
推荐(0)
摘要：
Remember the WordNeal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory and this may not trouble him, Neal gives it to Jiejie.Since Jiejie can't remember numbers clearly, he just uses sticks to help himself. Allowin 阅读全文
posted @ 2013-07-19 21:50
贾树丙
阅读(698)
评论(1)
推荐(0)
摘要：
Beijing GuardsBeijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in the 50s and 60s to make way for roads. The walls were protected by guard towers, and th 阅读全文
posted @ 2013-07-19 01:48
贾树丙
阅读(523)
评论(0)
推荐(0)
摘要：
PieMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a numberNof them, of various tastes and of various sizes.Fof my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since tha 阅读全文
posted @ 2013-07-19 01:23
贾树丙
阅读(555)
评论(0)
推荐(0)
摘要：
A Different TaskThe (Three peg) Tower of Hanoi problem is a popular one in computer science. Briefly the problem is to transfer all the disks from peg-Ato peg-Cusing peg-Bas intermediate one in such a way that at no stage a larger disk is above a smaller disk. Normally, we want the minimum number of 阅读全文
posted @ 2013-07-19 00:55
贾树丙
阅读(600)
评论(0)
推荐(0)
浙公网安备 33010602011771号