金甲虫的博客

#include#include#includeusing namespace std;int main(){ int n, i, j; double s, x[101], y[101]; while (cin >> n, n != 0) { for (i = 0; i < n; i++) { cin >> x[i] >> y[i]; } j = i;

原题描述Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room

原题描述Moving TablesProblem Description The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on

原题描述Problem Description 话说上回讲到海东集团面临内外交困，公司的元老也只剩下XHD夫妇二人了。显然，作为多年拼搏的商人，XHD不会坐以待毙的。 一天，当他正在苦思冥想解困良策的时候，突然想到了自己的传家宝，那是公司成立的时候，父亲作为贺礼送来的一个锦囊，徐父当时交代，不到万不得已的时候，不要打开它。“现在不正是最需要的时候吗？”，一边想，XHD一边找到了这个精心

原题描述Problem Description In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow who

原题描述Problem Description “Point, point, life of student!” This is a ballad（歌谣）well known in colleges, and you must care about your score in this exam too. How many points can you get? Now, I told y

原题描述Problem Description Ray 在数学课上听老师说，任何小数都能表示成分数的形式，他开始了化了起来，很快他就完成了，但他又想到一个问题，如何把一个循环小数化成分数呢? 请你写一个程序不但可以将普通小数化成最简分数，也可以把循环小数化成最简分数。Input 第一行是一个整数N，表示有多少组数据。 每组数据只有一个纯小数，也就是整数部分为0。小数的位数不超过

原题描述Problem Description Given a positive integer N, you should output the leftmost digit of N^N.Input The input contains several test cases. The first line of the input is a single integer T which

原题描述Problem Description Ignatius bought a land last week, but he didn’t know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now

原题描述Problem Description Give you a lot of positive integers, just to find out how many prime numbers there are.Input There are a lot of cases. In each case, there is an integer N representing the

原题描述Problem Description C++编程考试使用的实时提交系统，具有即时获得成绩排名的特点。它的功能是怎么实现的呢？ 我们做好了题目的解答，提交之后，要么“AC”，要么错误，不管怎样错法，总是给你记上一笔，表明你曾经有过一次错误提交，因而当你一旦提交该题“AC”后，就要与你算一算帐了，总共该题错误提交了几回。虽然你在题数上，大步地跃上了一个台阶，但是在耗时上要摊上你共花去

原题描述Problem Description 今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑 每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的 考生，并将他们的成绩按降序打印。 Input 测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 < N < 1000 )、考

// HDU ACM 1850 Being a Good Boy in Spring Festival#include using namespace std;#define MAX 101int N[MAX];int main(){ int m, t, cnt; while (cin>>m,m!=0) { t = 0; cnt = 0; for (int i = 1

原地址：http://www.byywee.com/page/M0/S607/607452.html 总结了一下ACM STEPS的各章内容，趁便附上我的Steps题号（每人的不一样）。别的，此文首要目标是为了装逼；大牛请疏忽；摸索欲斗劲强的请疏忽；其实不乐于从A+B刷起的可以找到须要的响应题号操练～～1.1.1 根蒂根基输入输出：LCY的 A+B 8题（1089~1096）1.2 C说话根蒂根基

原题描述Problem Description Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded. In the field of Cyberground,

原题描述Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands

原题描述 今年暑假不AC Problem Description “今年暑假不AC？” “是的。” “那你干什么呢？” “看世界杯呀，笨蛋！” “@#$%^&*%…” 确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。 作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，

原题描述Problem Description 对于幸存的灾民来说，最急待解决的显然是温饱问题，救灾部队一边在组织人员全力打通交通，一边在组织采购粮食。现在假设下拨了一定数量的救灾经费要去市场采购大米（散装）。如果市场有m种大米，各种大米的单价和重量已知，请问，为了满足更多灾民的需求，最多能采购多少重量的大米呢？Input 输入数据首先包含一个正整数C，表示有C组测试用例，每组测试用例的第

原题描述Problem Description FJ is surveying his herd to find the most average cow. He wants to know how much milk this ‘median’ cow gives: half of the cows give as much or more than the median; half give

原题描述Problem Description Here is a famous story in Chinese history. “That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the k

原题描述Problem Description There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It

原题描述Problem Description The Joseph’s problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, …, n, standing in circle every mth is