1643:H Frog Battle

题目描述
Frog prince is resisting foreign invasion, giving n coordinates, and the n coordinates formed polygon that they needed to protect the area. Now he knows m spise, given their positions, whether they dive into the protect area.
输入解释
Input data,the first line is an integer n, showed the polygon has several vertex.
After input n lines of data for the vertex coordinates (x, y).
Next input data to represent an integer m showed the number of points.
After m coordinates represent m spies.
输出解释

Output m lines. 

Each line shows the relationship between each point and area. 

If out of the area, output “out”, or in the area, output “in”.

输入样例
4
0 0
0 1
1 1
1 0
3
0.5 0.5
-0.5 -0.5
0.6 0.5
输出样例
in
out
in
提示

Limits: 

3≤n≤20,1≤m≤100,-104≤x,y≤104 


该题目包含在题集 SSPU新生赛

共提交 4

通过率 0.0%
时间上限 内存上限
1000 MS 128 MB

·

·

·

·

登陆或注册以提交代码