2013年5月17日
POJ 3752 字母旋转游戏
摘要： 字母旋转游戏Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7053Accepted: 2642Description给定两个整数M，N，生成一个M*N的矩阵，矩阵中元素取值为A至Z的26个字母中的一个，A在左上角，其余各数按顺时针方向旋转前进，依次递增放置，当超过26时又从A开始填充。例如，当M=5，N=8时，矩阵中的内容如下： A B C D E F G H V W X Y Z A B I U J K L M N C J ... 阅读全文
posted @ 2013-05-17 21:58 ~~Snail~~ 阅读(160) 评论(0) 推荐(0)
POJ 2242 The Circumference of the Circle
摘要： The Circumference of the CircleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6480Accepted: 4077DescriptionTo calculate the circumference of a circle seems to be an easy task - provided you know its diameter. But what if you don't? You are given the cartesian coordinates of three non-c 阅读全文
posted @ 2013-05-17 21:23 ~~Snail~~ 阅读(216) 评论(0) 推荐(0)
POJ 1240 Pre-Post-erous!
摘要： Pre-Post-erous!Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1976Accepted: 1206DescriptionWe are all familiar with pre-order, in-order and post-order traversals of binary trees. A common problem in data structure classes is to find the pre-order traversal of a binary tree when given the i 阅读全文
posted @ 2013-05-17 18:42 ~~Snail~~ 阅读(404) 评论(0) 推荐(0)