题目就不贴了。大概都是pick定理解决。
pick:S=a+b/2-1。s是多边形面积,a是多边形内的格点,b是多边形线或者顶点上的格点。
多边形线上的格点用gcd定理求。两顶点x和y变化的坐标最大公约数即是格点在这条线上的数量。
poj1265:
#include<limits>
#include<queue>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
#define LL __int64
#define eps 1e-8
#define pi acos(-1)
using namespace std;
int gcd(int a,int b){
if (b==0) return a;
else return gcd(b,a%b);
}
int main(){
int T,i,n;
scanf("%d",&T);
for (int cas=1;cas<=T;cas++){
scanf("%d",&n);
int x=0,y=0,xx,yy;
scanf("%d%d",&x,&y);
int a=gcd(fabs(x),fabs(y));
int b=0;
double ans=0;
for (i=1;i<n;i++){
scanf("%d%d",&xx,&yy);
a+=gcd(fabs(xx),fabs(yy));
xx+=x;
yy+=y;
ans+=(x*yy)-(xx*y);
x=xx;
y=yy;
}
ans=fabs(ans)/2;
b=(ans+1-a/2);
printf("Scenario #%d:\n",cas);
printf("%d %d %.1f\n",b,a,ans);
if (cas!=T) cout<<endl;
}
return 0;
}
poj2954:
#include<limits>
#include<queue>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
#define LL __int64
#define eps 1e-8
#define pi acos(-1)
using namespace std;
struct point{
int x,y;
};
point p[10];
int gcd(int a,int b){
if (b==0) return a;
else return gcd(b,a%b);
}
int across(point a,point b,point c){
return (a.x-c.x)*(b.y-c.y)-(a.y-c.y)*(b.x-c.x);
}
int main(){
while (~scanf("%d%d%d%d%d%d",&p[0].x,&p[0].y,&p[1].x,&p[1].y,&p[2].x,&p[2].y)){
if (p[0].x==0 && p[0].y==0 && p[1].x==0 && p[1].y==0 && p[2].x==0 && p[2].y==0)
break;
int area=fabs(across(p[0],p[1],p[2]))/2;
int s=gcd(fabs(p[0].x-p[1].x),fabs(p[0].y-p[1].y));
s+=gcd(fabs(p[1].x-p[2].x),fabs(p[1].y-p[2].y));
s+=gcd(fabs(p[0].x-p[2].x),fabs(p[0].y-p[2].y));
int ans=area+1-s/2;
printf("%d\n",ans);
}
return 0;
}