![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
===数学===
文章平均质量分 85
wJs9528-1
这个作者很懒,什么都没留下…
展开
-
LightOJ - 1259 Goldbach`s Conjecture
DescriptionGoldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the sum of t原创 2015-07-09 20:36:21 · 718 阅读 · 0 评论 -
半平面交模板
网上搜刮来的模板题目: POJ 3335 Rotating Scoreboard POJ 1474 Video Surveillance POJ 1279 Art Gallery POJ 3525 Most Distant Point from the Sea POJ 3384 Feng Shui POJ 1755 Triathlon POJ 254原创 2016-08-25 10:25:27 · 352 阅读 · 0 评论 -
HDU 1632 Polygons (凸包)
题意: 在平面内给出两个凸多边形,求出两个凸多边形不重合的面积凸多边形和凸多边形的图形交一定也是凸多边形,直接On2On^2求出图形交的凸多边形,再加加减减就能求出面积了 注意输入完所有数据后换行,题目上没有明确说明,莫名WA#include<cstring>#include<algorithm>#include<iostream>#include<cstdio>#include<cma原创 2016-08-24 08:57:11 · 682 阅读 · 0 评论 -
博弈类题目小结(HDU,POJ,ZOJ)
转载于http://blog.csdn.net/ACM_cxlove?viewmode=contents 首先当然要献上一些非常好的学习资料:基础博弈的小结:http://blog.csdn.net/acm_cxlove/article/details/7854530经典翻硬币游戏小结:http://blog.csdn.net/acm_cxlove/article/de转载 2016-08-06 18:19:19 · 1131 阅读 · 0 评论 -
CodeForces 32E Hide-and-Seek(线段交,点关于直线对称点)
Hide-and-SeekDescriptionVictor and Peter are playing hide-and-seek. Peter has hidden, and Victor is to find him. In the room where they are playing, there is only one non-transparent wall and one doubl原创 2016-08-17 20:04:17 · 613 阅读 · 0 评论 -
CodeForces 670D Triangles
D. TrianglesLittle Petya likes to draw. He drew N red and M blue points on the plane in such a way that no three points lie on the same line. Now he wonders what is the number of distinct triangles wit原创 2016-08-17 18:14:56 · 563 阅读 · 0 评论 -
几种极角排序的cmp函数摘录
原文:http://blog.csdn.net/hysfwjr/article/details/8949810double cross(const point &p1, const point &p2, const point &q1, const point &q2){ return (q2.y-q1.y)*(p2.x-p1.x)-(q2.x-q1.x)*(p2.y-p1.转载 2016-04-26 23:12:10 · 520 阅读 · 0 评论 -
SPOJ ARCTAN Use of Function Arctan (三角公式atrtan 高中数学)
Use of Function ArctanDescriptionIt's easy to know that arctan(1/2)+arctan(1/3)=arctan(1).The problem is,to some fixed number A,you have to write a program to calculate the minimum sum B+C.A原创 2016-03-08 16:25:09 · 1374 阅读 · 0 评论 -
URAL 1017 Staircases
对于一个最小划分数k和总数n来说,考虑两种情况1.最小划分数刚好等于k2.最小划分数大于k那么就有 dp[k][n]=dp[k+1][n]+dp[k+1][n-k];其含义为第一种情况刚好是 k+1 时将 n-k 的所有情况前面加上一个k 第二种情况刚好就是 k+1时 n的划分那么初始化dp[i][i]=1再递推下去就行了#include#include原创 2016-03-07 14:26:57 · 119 阅读 · 0 评论 -
hdu 5299 Circles Game
Circles GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 547 Accepted Submission(s): 150Problem DescriptionThere are n原创 2015-07-22 20:59:55 · 882 阅读 · 0 评论 -
HDU 4946 Area of Mushroom (凸包)
题意:一个师傅有n个徒弟,每个徒弟在二维坐标系内有一个坐标和速度,问哪些徒弟能够到达的距离是无穷远,某个徒弟某个点能够到达时间必须严格小于其他徒弟首先最大速度的徒弟能够到达的面积肯定能够囊括其他所有徒弟的,那么首先把速度最大的所有徒弟全部取出来,此时发现取出的凸包就是解(凸包里面的点肯定被覆盖),注意一下凸包边界上的点,用int处理精度#include<cstring>#include<iostr原创 2016-08-26 08:52:56 · 270 阅读 · 0 评论