1.链接地址: http://bailian.openjudge.cn/practice/1005/ http://poj.org/problem?id=1005 2.题目: I Think I Need a Houseboat Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 82376   Accepted: 35628 Description Fred Mapper is considering purchasing…

POJ. 1005 I Think I Need a Houseboat(水 ) 代码总览 #include <cstdio> #include <cstring> #include <cmath> #include <queue> #include <stack> #include <vector> #define nmax using namespace std; const double pi = acos(-1); int m…

    I Think I Need a Houseboat Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 81874   Accepted: 35368 Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the la…

I Think I Need a Houseboat Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 85149   Accepted: 36857 Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land,…

#include <iostream> using namespace std; const double pi = 3.1415926535; int main() { ;; double x,y; cin >> t; while(t--) { ++time; cin >> x >> y; double area = pi*(x*x + y*y); ; cout<<"Property "<<time<<…

一. 题目 I Think I Need a Houseboat Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 97512   Accepted: 42430 Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the…

I Think I Need a Houseboat POJ - 1005 解题思路:水题 #include <iostream> #include <cstdio> #include <cmath> using namespace std; int main() { int n; double xx,yy; double rr; double area,r; int year; scanf("%d",&n); ;i<n;i++){ s…

1.链接地址: http://poj.org/problem?id=2141 http://bailian.openjudge.cn/practice/2141/ 2.题目: Message Decowding Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11784   Accepted: 6562 Description The cows are thrilled because they've just learn…

1.链接地址: http://poj.org/problem?id=2105 http://bailian.openjudge.cn/practice/2105 2.题目: IP Address Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 18146   Accepted: 10456 Description Suppose you are reading byte streams from any device, r…

1.链接地址: http://bailian.openjudge.cn/practice/2027 http://poj.org/problem?id=2027 2.题目: 总Time Limit: 1000ms Memory Limit: 65536kB Description Zombies love to eat brains. Yum. Input The first line contains a single integer n indicating the number of da…

1.链接地址: http://bailian.openjudge.cn/practice/2013 http://poj.org/problem?id=2013 2.题目: Symmetric Order Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 11793   Accepted: 7181 Description In your job at Albatross Circus Management (yes, it…

1.链接地址: bailian.openjudge.cn/practice/1088 http://poj.org/problem?id=1088 2.题目: 总Time Limit: 1000ms Memory Limit: 65536kB Description Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激.可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你.Michael想知道载一个 区域中最长的滑坡.区域由一个二维数组给出.数组的…

1.链接地址: http://bailian.openjudge.cn/practice/2001 http://poj.org/problem?id=2001 2.题目: Shortest Prefixes Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 12208   Accepted: 5210 Description A prefix of a string is a substring starting at t…

1.链接地址: http://bailian.openjudge.cn/practice/2000 http://poj.org/problem?id=2000 2.题目: 总Time Limit: 1000ms Memory Limit: 65536kB Description The king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold c…

1.链接地址: http://poj.org/problem?id=1936 http://bailian.openjudge.cn/practice/1936 2.题目: All in All Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 26651   Accepted: 10862 Description You have devised a new encryption technique which encod…

1.链接地址: bailian.openjudge.cn/practice/1661 http://poj.org/problem?id=1661 2.题目: 总Time Limit: 1000ms Memory Limit: 65536kB Description "Help Jimmy" 是在下图所示的场景上完成的游戏.场景中包括多个长度和高度各不相同的平台.地面是最低的平台,高度为零,长度无限. Jimmy 老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒.当…

1.链接地址: http://bailian.openjudge.cn/practice/1915 http://poj.org/problem?id=1915 2.题目: 总Time Limit: 1000ms Memory Limit: 65536kB Description BackgroundMr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from o…

1.链接地址: http://bailian.openjudge.cn/practice/1163 http://poj.org/problem?id=1163 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 73 88 1 02 7 4 44 5 2 6 5 (Figure 1) Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers pa…

1.链接地址: http://bailian.openjudge.cn/practice/1844 http://poj.org/problem?id=1844 2.题目: Sum Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 10031   Accepted: 6564 Description Consider the natural numbers from 1 to N. By associating to eac…

1.链接地址: http://bailian.openjudge.cn/practice/1321 http://poj.org/problem?id=1321 2.题目: 棋盘问题 Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 20403   Accepted: 10138 Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别.要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同…

1.链接地址: http://bailian.openjudge.cn/practice/1753/ http://poj.org/problem?id=1753 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is wh…

1.链接地址: http://bailian.openjudge.cn/practice/1191/ http://poj.org/problem?id=1191 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 将一个8*8的棋盘进行如下分割:将原棋盘割下一块矩形棋盘并使剩下部分也是矩形,再将剩下的部分继续如此分割,这样割了(n-1)次后,连同最后剩下的矩形棋盘共有n块矩形棋盘.(每次切割都只能沿着棋盘格子的边进行)原棋盘上每一格有一个分值,一块矩形棋盘的总分为其所含各…

1.链接地址: http://bailian.openjudge.cn/practice/1723/ http://poj.org/problem?id=1723 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 N soldiers of the land Gridland are randomly scattered around the country. A position in Gridland is given by a pair (x,y) of integ…

1.链接地址: http://bailian.openjudge.cn/practice/1658 http://poj.org/problem?id=1658 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 Eva的家庭作业里有很多数列填空练习.填空练习的要求是:已知数列的前四项,填出第五项.因为已经知道这些数列只可能是等差或等比数列,她决定写一个程序来完成这些练习. 输入 第一行是数列的数目t(0 <= t <= 20).以下每行均包含四个整数,表示数列的前四项.…

1.链接地址: http://bailian.openjudge.cn/practice/1979 http://poj.org/problem?id=1979 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile.…

1.链接地址: http://bailian.openjudge.cn/practice/1664 http://poj.org/problem?id=1664 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法. 输入 第一行是测试数据的数目t(0 <= t <= 20).以下每行均包含二个整数M和N,以空格分开.1<=M,N<…

1.链接地址: http://poj.org/problem?id=1316 http://bailian.openjudge.cn/practice/1316 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define…

1.链接地址: http://poj.org/problem?id=1458 http://bailian.openjudge.cn/practice/1458/ 2.题目: Common Subsequence Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 35411   Accepted: 14080 Description A subsequence of a given sequence is the given…

1.链接地址: http://bailian.openjudge.cn/practice/1251/ http://poj.org/problem?id=1251 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 热 带岛屿Lagrishan的首领现在面临一个问题:几年前,一批外援资金被用于维护村落之间的道路,但日益繁茂的丛林无情的侵蚀着村民的道路,导致道路维 修开销巨大,长老会不得不放弃部分道路的维护.上图左侧图显示的是正在使用道路的简图以及每条路每个月的维修费用(单位…

1.链接地址: http://bailian.openjudge.cn/practice/1226/ http://poj.org/problem?id=1226 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its in…