鏈接： https://www.nowcoder.com/acm/contest/102/E
來源：牛客網

題目描述

PSacfc is a student majors in Communication Engineering, and Wireless Mobile System is his favorite course.
One day, when the teacher talked about Cellular Mobile Communication, he thought of a problem.
Given n regular hexagons, find the minimum number of sides exposed. A side of a regular hexagon exposed means no other hexagons’ sides coincided with it. One side can be coincided with no more than one another.
For example, the first situation has 3 hexagons with 12 sides exposed, and the second situation has 3 hexagons with 14 sides exposed.
Your task is to find the minimum number of sides exposed with n regular hexagons.

輸入描述:

The first line contains an integer number T, the number of test cases. i^t? of each next T lines contains an integer number n(1 ≤ n ≤ 10⁹).

輸出描述:

For each test case print a number, minimum number of sides exposed.示例1

輸入

3 3 4 7

輸出

12 14 18 #include<bits/stdc++.h> using namespace std; int main() {int t;cin>>t;while(t--){long long n;cin>>n;long long ans=2*ceil(sqrt(12*n-3));printf("%lld\n",ans);}return 0; }

總結

以上是生活随笔為你收集整理的长安大学第三届ACM-ICPC程序设计竞赛 E题的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。