Very Suspicious Codeforces Solution | Codeforces Problem Solution 2022

Very Suspicious Codeforces Solution | Codeforces Problem Solution 2022

D. Very Suspicious

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sehr Sus is an infinite hexagonal grid as pictured below, controlled by MennaFadali, ZerooCool and Hosssam.

Solution Click Below:-  CLICK HERE

They love equilateral triangles and want to create 𝑛$n$ equilateral triangles on the grid by adding some straight lines. The triangles must all be empty from the inside (in other words, no straight line or hexagon edge should pass through any of the triangles).

Prof. Slim Codeforces Solution | Codeforces Problem Solution 2022

Dorms War Codeforces Solution | Codeforces Problem Solution 2022

Where is the Pizza? Codeforces Solution | Codeforces Problem Solution 2022

Very Suspicious Codeforces Solution | Codeforces Problem Solution 2022

Hemose on the Tree Codeforces Solution | Codeforces Problem Solution 2022

Jee, You See? Codeforces Solution | Codeforces Problem Solution 2022

You are allowed to add straight lines parallel to the edges of the hexagons. Given 𝑛$n$, what is the minimum number of lines you need to add to create at least 𝑛$n$ equilateral triangles as described?

Adding two red lines results in two new yellow equilateral triangles.

Input

The first line contains a single integer 𝑡$t$ (1≤𝑡≤105$1\le t\le {10}^5$) — the number of test cases. Then 𝑡$t$ test cases follow.

Each test case contains a single integer 𝑛$n$ (1≤𝑛≤109$1\le n\le {10}^9$) — the required number of equilateral triangles.

Output

For each test case, print the minimum number of lines needed to have 𝑛$n$ or more equilateral triangles.

Join Now for Solution:-