abns的博客

“ 改革春风吹满地,  不会AC没关系;  实在不行回老家，  还有一亩三分地。  谢谢!（乐队奏乐）”  话说部分学生心态极好，每天就知道游戏，这次考试如此简单的题目，也是云里雾里，而且，还竟然来这么几句打油诗。  好呀，老师的责任就是帮你解决问题，既然想种田，那就分你一块。  这块田位于浙江省温州市苍南县灵溪镇林家铺子村，多边形形状的一块地，原本是linle 的，现在就准备送给你了。不过，任何...

http://poj.org/problem?id=3304 判断所有线段段点是否能出现一个直线经过所有线段 #include<iostream> #include<math.h> #include<cstdio> const double eps = 1e-8; const int maxn = 1005; using namespace std;...

area=I+E/2-1(I为内部格数，E为边上的点数） 边上格点数 = gcd(abs(x),abs(y))-1; #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #define N 1003 usin...

#include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; struct Point { int x,y; Point(){} Point(int x,int y):x(x),y(y){} }; typ...

#include <iostream> #include <string.h> #include <stdio.h> #include <math.h> #define N 150 #define eps 1e-8 #define T 100 #define delta 0.98 #define INF 1e99 using namespa...

#include <iostream> #include <cstdio> #include <cmath> #include <cstring> #include <algorithm> #include <cstdlib> #include <iomanip> using namespace std; con...

http://poj.org/problem?id=2653 #include<iostream> #include<cstdio> #define eps 1e-8 const int maxn = 1e5+10; using namespace std; struct Point{ double x; double y; }pt1[maxn],pt2[maxn...

#include<iostream> #include<cstdio> #include<math.h> #include<algorithm> #define inf 0x3f3f3f const int maxn = 1e3+10; const double eps = 1e-8; using namespace std; struct Poi...

There are many secret openings in the floor which are covered by a big heavy stone. When the stone is lifted up, a special mechanism detects this and activates poisoned arrows that are shot near the o...

nt judgecross(){ if(min(p[0].x,p[1].x)>max(p[2].x,p[3].x)||min(p[0].y,p[1].y)>max(p[2].y,p[3].y)||max(p[0].x,p[1].x)<min(p[2].x,p[3].x)||max(p[0].y,p[1].y)<min(p[2].y,p[3].y)){ return ...