- 博客(10)
- 资源 (1)
- 收藏
- 关注
原创 向大牛看齐
比较不错的博客链接:结构之法,算法之道:http://blog.csdn.net/v_JULY_v小媛在努力:http://blog.csdn.net/zxy_snow/article/details/6347459http://www.xysay.com/archives/185外国的很棒的面试网站:http://www.careercup.com/pageCSD
2013-05-26 00:30:24 1755 4
原创 POJ1113Wall(计算几何基础)
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25657 Accepted: 8532DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wal
2013-05-25 21:23:14 1966
原创 POJ2187Beauty Contest(求凸多边形直径)
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 23706 Accepted: 7244DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, e
2013-05-25 20:15:22 2025
原创 hdu1392(Surround the Trees)凸包问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5804 Accepted Submission(s): 2192Problem DescriptionThere are a lot of trees in an ar
2013-05-25 19:39:30 1177
原创 POJ1410 Intersection
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9733 Accepted: 2566DescriptionYou are to write a program that has to decide whether a given line segment intersects a
2013-05-23 20:49:53 1209 2
原创 POJ Pick-up sticks
Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 7550 Accepted: 2789DescriptionStan has n sticks of various length. He throws them one at a t
2013-05-22 16:44:33 974
原创 文件重定向
函数名:freopen 声明:FILE *freopen( const char *path, const char *mode, FILE *stream ); 所在文件: stdio.h 参数说明: path: 文件名,用于存储输入输出的自定义文件名。 mode: 文件打开的模式。和fopen中的模式(如r-只读, w-写)相同。 stream: 一个文件,通常
2013-05-04 22:22:56 1726
原创 奇怪的比赛(蓝桥杯)
四、奇怪的比赛 某电视台举办了低碳生活大奖赛。题目的计分规则相当奇怪: 每位选手需要回答10个问题(其编号为1到10),越后面越有难度。答对的,当前分数翻倍;答错了则扣掉与题号相同的分数(选手必须回答问题,不回答按错误处理)。 每位选手都有一个起步的分数为10分。 某获胜选手最终得分刚好是100分,如果不让你看比赛过程,你能推断出他(她)哪个题目答对了,哪个
2013-05-04 19:43:51 1949
原创 hdu2080(夹角有多大II)
此题难度不大,但是收获不小,在计算中尽量少用除法。。。下面给出两个代码,其中一个是错误的答案,比较两者的区别。。。//wrong#include #include #include using namespace std;struct Point{ double x, y; Point(double x = 0, double y = 0):x(x), y(y) { }
2013-05-02 20:25:04 1412
原创 hdu2036(改革春风吹满地)
#include #include #include #include #include using namespace std;const int maxn = 110;struct Point{ double x, y; Point(double x = 0, double y = 0):x(x), y(y) { }};typedef Point Vect
2013-05-02 17:45:27 1429
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人