HUT_tao

摘要： 题意：给定你一个以质数为底表示的数；问你这个数减1，之后用质数为底的表示法。例如：17 1 = 17^1 =17 - 1；5 1 2 1 = 5^1*2^1=10 - 1；2 4= 2^4 = 163 2 = 3^2= 9;View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int prime[4024],cnt; 阅读全文

摘要： 题意：输入m, n, d。求出m,m+1,m+2,````m+n的一个排列。使得任意的连续k个数之和都为合数，2<=k<=d。注意如果开始时连续数小于d时也要是合数；用DFS暴力搜索；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int num[1024],S,E,d;;bool visit[10 阅读全文

摘要： 这个题是求外心的问题；我们可以用直线相交做，也可以用向量做；直线相交：View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Point{publ 阅读全文

摘要： 求多边形的面积；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Point{public: int x,y; }point[1000024 阅读全文

摘要： 这个题要考虑直线在正方形的内部；顶点给你的顺序不一定就是左上角到右下角；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Point{pub 阅读全文

摘要： 这个题用到了pick定理：多边形的面积 = 内部的数的和 + 边上的点的和/2 -1;View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Po 阅读全文

摘要： 这题只要判断边上的中点与线段相交的交点就可以了，求出最小的交点数；我们知道区域A的任何一点到线段a上的任何一点，要通过上面的3条线段，那么我直接连接区域A的点与线段a的点，经过的一定是3条直线，并且也是3个焦点；因此，该题我们就只要判断交点的个数就可以了；View Code View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set& 阅读全文

摘要： 这个题就是纯暴力枚举：枚举所有顶点的连线的直线与所有线段是否有交点；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Line{public 阅读全文

摘要： 这个题就是求凸包；极角排序：View Code View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Point{public: double 阅读全文

摘要： 这个题就是求无论你站在家的那个地方都能看到财产的最大值；这个题可以从正面做，直接用叉积求出最大值；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<cstring>using namespace std;class Line{public: double x1,x2,y; }line[10000];Line house,pro;int dcmp( double x ) 阅读全文