algorithm
더블릿|dovelet - 정다각형 면적/rpoly
블루건
2016. 7. 18. 23:11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | #include <iostream> #include <cmath> using namespace std; int main() { const double PI = 3.14159265359; double r; double n; cin >> r >> n; double rad = (360 / n) * (PI / 180); cout.precision(3); cout << fixed << (0.5 * r *r * sin(rad) * n) << endl; return 0; } | cs |