Educational Codeforces Round 87 (Rated for Div. 2)----C1. Simple Polygon Embedding

最新推荐文章于 2022-10-19 00:39:58 发布

我是个菜鸡.

最新推荐文章于 2022-10-19 00:39:58 发布

阅读量225

点赞数

本文链接：https://blog.csdn.net/weixin_45988242/article/details/106197677

版权

The statement of this problem is the same as the statement of problem C2. The only difference is that, in problem C1, n is always even, and in C2, n is always odd.

You are given a regular polygon with 2⋅n vertices (it’s convex and has equal sides and equal angles) and all its sides have length 1. Let’s name it as 2n-gon.

Your task is to find the square of the minimum size such that you can embed 2n-gon in the square. Embedding 2n-gon in the square means that you need to place 2n-gon in the square in such way that each point which lies inside or on a border of 2n-gon should also lie inside or on a border of the square.

You can rotate 2n-gon and/or the square.

Input
The first line contains a single integer T (1≤T≤200) — the number of test cases.

Next T lines contain descriptions of test cases — one per line. Each line contains single even integer n (2≤n≤200). Don’t forget you need to embed 2n-gon, not an n-gon.

Output
Print T real numbers — one per test case. For each test case, print the minimum length of a side of the square 2n-gon can be embedded in. Your answer will be considered correct if its absolute or relative error doesn’t exceed 10−6.

Example
inputCopy
3
2
4
200
outputCopy
1.000000000
2.414213562
127.321336469
题意：给你偶数n，让n=n*2;就是正n边形，它外接正方形的面积
思路

不是求s写错了，输出L就行了~~~~~~~

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
using namespace std;
#define inf 0x3f3f3f3f3f;
typedef long long ll;
using namespace std;
double pi = acos(-1.0);
int main()
{
	int t; cin >> t;
	while (t--)
	{
		int n; cin >> n;
		n = n * 2;
		double a = (n - 2) * 180.00;
		a /= (n * 2.00);
		a = (pi / 180.000)*(a*1.0);
		printf("%.7f\n", tan(a));
		
	}
}