上一页 1 ··· 8 9 10 11 12
摘要: 题目:ConstraintsTime Limit: 1 secs, Memory Limit: 256 MBDescriptionMike has recently been visited by extraterrestrials from planet X3, where everyone's name is a positive integer. All residents of the planet know each other. Two X3-ians calculate the strength of their friendship by converting thei 阅读全文
posted @ 2013-09-19 17:47 Jolin123 阅读(334) 评论(0) 推荐(0) 编辑
摘要: 题目:ConstraintsTime Limit: 1 secs, Memory Limit: 256 MBDescriptionThe number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes in the range of two supplied numbers a and 阅读全文
posted @ 2013-09-18 18:08 Jolin123 阅读(499) 评论(0) 推荐(0) 编辑
摘要: 题目:ConstraintsTime Limit: 1 secs, Memory Limit: 256 MB , Special JudgeDescriptionThere are n children in a country marked by integers from 1 to n.They often fight with each other. For each pair of child A and child B, either A beats B or B beats A. It is not possible that both A beats B and B beats 阅读全文
posted @ 2013-09-17 16:53 Jolin123 阅读(281) 评论(0) 推荐(0) 编辑
摘要: 题目:DescriptionIt's Bessie's feeding time, and Farmer John is trying to decide where to put her. FJ has a farm that comprises W x H (1 2 #include 3 using namespace std; 4 5 #define MAX 750 6 7 struct Point{ 8 int x,y; 9 Point(int i,int j){10 x=i;11 y=j;12 }13 };14 15 v... 阅读全文
posted @ 2013-09-17 14:26 Jolin123 阅读(375) 评论(0) 推荐(0) 编辑
摘要: 题目:DescriptionWindbreaker was planning to send his friends some necklaces as New Year gifts. To show sincerity ,he decided to make the necklaces all by himself. He bought some kinds of pearls and each kind of pearls has a different color from others. He wanted to make each necklace consisted of M pe 阅读全文
posted @ 2013-09-16 23:42 Jolin123 阅读(377) 评论(0) 推荐(0) 编辑
上一页 1 ··· 8 9 10 11 12