当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2663:Tetrahedroid

题目描述
You are given a tetrahedroid and a point P outside it. How many faces can be seen from P?
A face can be seen form P means that if you connect P and any point in this face (exclude the boundary) with a line segment, the line segment does not intersect with other faces of the tetrahedroid.
输入解释
The input contains multiple test cases.
The first line contains a number T describing the number of test cases.
For each test case:
The first 4 lines describe the tetrahedroid in the format below:
Ax, Ay, Az
Bx, By, Bz
Cx, Cy, Cz
Dx, Dy, Dz
After that comes 1 line describing the point P in the format below:
Px, Py, Pz
输出解释
For each test case, output one line containing a integer representing the number of faces can be seen from P.
输入样例
2 
0 0 0 
0 0 1 
0 1 0 
1 0 0 
-1 -1 -1 
0 0 0 
0 0 1 
0 1 0 
1 0 0 
1 1 1 
输出样例
3 
1 
来自杭电HDUOJ的附加信息
Recommend zty

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-2663

最后修改于 2020-10-25T22:55:40+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)