链接1:http://openoj.awaysoft.com:8080/judge/contest/view.action?cid=269#problem/A
链接二:http://poj.org/problem?id=1654
A - Area
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1654
Description
You are going to compute the area of a special kind of polygon. One vertex of the polygon is the origin of the orthogonal coordinate system. From this vertex, you may go step by step to the following vertexes of the polygon until back to the initial vertex. For each step you may go North, West, South or East with step length of 1 unit, or go Northwest, Northeast, Southwest or Southeast with step length of square root of 2.
For example, this is a legal polygon to be computed and its area is 2.5:
Input
The first line of input is an integer t (1 <= t <= 20), the number of the test polygons. Each of the following lines contains a string composed of digits 1-9 describing how the polygon is formed by walking from the origin. Here 8, 2, 6 and 4 represent North, South, East and West, while 9, 7, 3 and 1 denote Northeast, Northwest, Southeast and Southwest respectively. Number 5 only appears at the end of the sequence indicating the stop of walking. You may assume that the input polygon is valid which means that the endpoint is always the start point and the sides of the polygon are not cross to each other.Each line may contain up to 1000000 digits.
Output
For each polygon, print its area on a single line.
Sample Input
4
5
825
6725
6244865
Sample Output
0
0
0.5
2
思路:求多边行的面积,这里每走一步都是走单位格子。因此,利用方向的变化来确定每步的坐标,根据叉乘的定义求求解面积,还要注意精度
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
const int maxn=1000001;
char s[maxn];
__int64 a[10][2]={{0,0},{-1,-1},{0,-1},{1,-1},{-1,0},{0,0},{1,0},{-1,1},{0,1},{1,1}};//八个方向
int main()
{
int t,i,j,len;
__int64 area,x1,y1,x2,y2,c;
while(scanf("%d",&t)!=EOF)
{
while(t--)
{area=0;
scanf("%s",s);
len=strlen(s);
x1=0;y1=0;
for(i=0;i<len;i++)
{
if(s[i]=='5')
break;
else
{
x2=x1+a[s[i]-'0'][0];y2=y1+a[s[i]-'0'][1];
area+=(x1*y2-x2*y1);
x1=x2;y1=y2;
}
}
if(area<0)area=-area;
c=area/2;
if(c*2!=area)
printf("%I64d.5\n",c);
else
printf("%I64d\n",c);
}
}
return 0;
}