forked from marioyc/Online-Judge-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1265 - Area.cpp
45 lines (30 loc) · 971 Bytes
/
1265 - Area.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int T,N;
int x[100],y[100],x2[101],y2[101];
scanf("%d",&T);
for(int tc = 1;tc <= T;++tc){
scanf("%d",&N);
x2[0] = 0; y2[0] = 0;
for(int i = 0;i < N;++i){
scanf("%d %d",&x[i],&y[i]);
x2[i + 1] = x2[i] + x[i];
y2[i + 1] = y2[i] + y[i];
}
int area = 0;
for(int i = 0;i < N;++i)
area += x2[i] * y2[i + 1] - x2[i + 1] * y2[i];
area = abs(area);
int B = 0;
for(int i = 0;i < N;++i){
int dx = abs(x[i]);
int dy = abs(y[i]);
B += __gcd(dx,dy);
}
int I = (area - B) / 2 + 1;
printf("Scenario #%d:\n%d %d %.1f\n\n",tc,I,B,area / 2.0);
}
return 0;
}