codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1354C1.md (1541B)


      1 Source: https://codeforces.com/problemset/problem/1354/C1
      2 
      3 C1. Simple Polygon Embedding
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 You are given a regular polygon with $2 \cdot 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.
     24 
     25 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.
     26 
     27 You can rotate $2n$-gon and/or the square.
     28 
     29 Input
     30 
     31 The first line contains a single integer $T$ ($1 \le T \le 200$) — the number of test cases.
     32 
     33 Next $T$ lines contain descriptions of test cases — one per line. Each line contains single even integer $n$ ($2 \le n \le 200$). Don't forget you need to embed $2n$-gon, not an $n$-gon.
     34 
     35 Output
     36 
     37 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}$.
     38 
     39 Example
     40 
     41 Input
     42 
     43 ```
     44 3
     45 2
     46 4
     47 200
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 1.000000000
     54 2.414213562
     55 127.321336469
     56 ```