随笔分类 -  设计开发

摘要:不值一讲的水题 阅读全文
posted @ 2013-01-25 14:52 S.Zhang 阅读(856) 评论(0) 推荐(0)
摘要:给出学生3门课的成绩,求每名学生在3门课以及平均分中所能取得的最高排名。 阅读全文
posted @ 2013-01-23 14:43 S.Zhang 阅读(1763) 评论(1) 推荐(0)
摘要:给定正整数n2^30,求出从0到n所有整数中1的个数 阅读全文
posted @ 2013-01-21 16:36 S.Zhang 阅读(1220) 评论(0) 推荐(0)
摘要:1002题的改进版,加法变乘法 阅读全文
posted @ 2013-01-17 22:55 S.Zhang 阅读(238) 评论(0) 推荐(0)
摘要:The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop. 阅读全文
posted @ 2013-01-17 17:29 S.Zhang 阅读(206) 评论(0) 推荐(0)
摘要:Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 = i = j = K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20. Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence. 阅读全文
posted @ 2013-01-17 17:28 S.Zhang 阅读(1097) 评论(0) 推荐(0)
摘要:At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you are supposed to find the ones who have unlocked and locked the door on that day. 阅读全文
posted @ 2013-01-17 17:28 S.Zhang 阅读(442) 评论(0) 推荐(0)
摘要:Calculate a + b and output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four digits). 阅读全文
posted @ 2013-01-16 22:51 S.Zhang 阅读(735) 评论(0) 推荐(0)
摘要:简要介绍如何自定义博客园博客界面已经增加自定义内容 阅读全文
posted @ 2009-04-30 21:20 S.Zhang 阅读(1745) 评论(1) 推荐(2)