B - Space BowlingTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87643#problem/B Description The inhabitants of planets orbiting around the pulsar PSR 2010+15 enjoy playing space bowling. A few cylin…

题目: Description You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a computer program to complete the task. The space station is made up with a number…

URAL 2078~2089 A - Bowling game 题目描述:给出保龄球每一局击倒的球数,按照保龄球的规则,算出总得分的最小值和最大值. solution 首先是最小值:每一局第一球击倒\(0\)个,第二球击倒给定的数目,最后一局比较特殊,如果最后一局得分超过\(20\),最后一局只能是\(10, 10, ?\),否则第一球可以击倒\(0\)个. 然后是最大值:每一局击倒给定的数目,最后一局的击球数往前靠. 然后按规则算分即可. 时间复杂度:\(O(10)\) C - Wallet…

啥也不说了,直接看图吧…… 代码如下: #include<stdio.h> #include<iostream> #include<math.h> using namespace std; #define LL long long struct point { LL x,y,z; }; bool fun(point a,point b,point c,point d) { point p1, p2,p3; p1.x = a.x-d.x; p1.y = a.y-d.y;…

1075. Thread in a Space Time limit: 1.0 secondMemory limit: 64 MB There are three points in a 3-dimensional space: A, B and C. All the coordinates of the points are integer numbers with absolute values not greater than 1000. A solid ball with a cente…

2036. Intersect Until You're Sick of It 题目连接: http://acm.timus.ru/problem.aspx?space=1&num=2036 Description Ural contests usually contain a lot of geometry problems. Many participants do not conceal their discontent with such disbalance. Still, we ha…

Space Ant Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2876   Accepted: 1839 Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y19…

题目: Bowling game In all asocial teams members ignore each other uniformly, each tight-knit team builds up team spirit their own way. Olya, Egor and Oleg, for example, go play bowling. This story is about how they once decided to take their coach Deni…

题目链接:http://acm.timus.ru/problem.aspx?space=1&num=1046 参考博客:http://hi.baidu.com/cloudygoose/item/21fee021a5db348d9d63d17b 参考资料(向量的旋转):http://www.cnblogs.com/woodfish1988/archive/2007/09/10/888439.html 题目大意:就是已知n个点,n个角.点Mi可以与多边形Ai和Ai+1构成等腰三角形,顶角为ang[i…

http://poj.org/problem?id=2031 题意 给出三维坐标系下的n个球体,求把它们联通的最小代价. 分析 最小生成树加上一点计算几何.建图,若两球体原本有接触,则边权为0:否则边权为它们球心的距离-两者半径之和.这样来跑Prim就ok了.注意精度. #include<iostream> #include<cmath> #include<cstring> #include<queue> #include<vector> #in…