UVA 12301 - An Angular Puzzle(计算几何)
来源:互联网 发布:centos l2tp 编辑:程序博客网 时间:2024/05/21 00:55
这题就设AB是1,然后正弦余弦定理去搞搞搞就可以了
代码:
#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const double PI = acos(-1.0);int a, b, c, d, e;double get(double x) { return x / 180.0 * PI;}int main() { while (~scanf("%d%d%d%d%d", &a, &b, &c, &d, &e) && a || b || c || d || e) { if (a + b + c + d + e != 180) { printf("Impossible\n"); continue; } double ACB = a, CAE = b, EAB = c, CBD = d, DBA = e; double AB = 1.0; double AOB = 180 - EAB - DBA; double CBA = CBD + DBA; double CAB = EAB + CAE; double AEB = 180 - EAB - CBA; double ADB = 180 - DBA - CAB; double BD = AB / sin(get(ADB)) * sin(get(CAB)); double AE = AB / sin(get(AEB)) * sin(get(CBA)); double AO = AB / sin(get(AOB)) * sin(get(DBA)); double BO = AB / sin(get(AOB)) * sin(get(EAB)); double EO = AE - AO; double DO = BD - BO; double DE = sqrt(EO * EO + DO * DO - DO * EO * 2 * cos(get(AOB))); double x = asin(DO * sin(get(AOB)) / DE) * 180 / PI; printf("%.2f\n", x); } return 0;}
0 0
- UVA 12301 - An Angular Puzzle(计算几何)
- UVA - 12301 - An Angular Puzzle (计算几何~平面三角)
- An Angular Puzzle - UVa 12301 几何
- uva 12301 - An Angular Puzzle(几何)
- uva 12301 - An Angular Puzzle
- UVA - 12301-An Angular Puzzle
- UVa 12301 An Angular Puzzle 平面角度计算
- 计算几何专项:UVa 12301
- CodeForces 281c Rectangle Puzzle 计算几何
- uva 11178 计算几何
- UVA-11178-计算几何
- UVA-11796-计算几何
- 计算几何专项:UVa 11437
- 计算几何专项:UVa 11646
- 计算几何专项:UVa 11817
- 计算几何专项:UVa 11524
- 计算几何专项:UVa 10566
- 计算几何专项:UVa 11186
- java网络编程---udp
- android powerkey触发小应用总结
- 第三周项目5-4:数组作成员数据-数据保存
- QML 自定义进度条样式
- Servlet 3.0 新特性详解(二)异步处理支持
- UVA 12301 - An Angular Puzzle(计算几何)
- hdu 2647 Reward 拓扑排序。
- LeetCode OJ Word Ladder II
- php 面试题收集
- android获取多媒体库的视频、音频、图片
- CCTV10专题《重访---黑客江湖》
- Subsets
- set::count
- Servlet 3.0 新特性详解(三)注解支持