CaoHaha's staff(规律,2017中国大学生程序设计竞赛 - 网络选拔赛)

CaoHaha's staff

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 825    Accepted Submission(s): 474

Problem Description

"You shall not pass!"
After shouted out that,the Force Staff appered in CaoHaha's hand.
As we all know,the Force Staff is a staff with infinity power.If you can use it skillful,it may help you to do whatever you want.
But now,his new owner,CaoHaha,is a sorcerers apprentice.He can only use that staff to send things to other place.
Today,Dreamwyy come to CaoHaha.Requesting him send a toy to his new girl friend.It was so far that Dreamwyy can only resort to CaoHaha.
The first step to send something is draw a Magic array on a Magic place.The magic place looks like a coordinate system,and each time you can draw a segments either on cell sides or on cell diagonals.In additional,you need 1 minutes to draw a segments.
If you want to send something ,you need to draw a Magic array which is not smaller than the that.You can make it any deformation,so what really matters is the size of the object.
CaoHaha want to help dreamwyy but his time is valuable(to learn to be just like you),so he want to draw least segments.However,because of his bad math,he needs your help.

 

Input

The first line contains one integer T(T<=300).The number of toys.
Then T lines each contains one intetger S.The size of the toy(N<=1e9).

 

Output

Out put T integer in each line ,the least time CaoHaha can send the toy.

 

Sample Input

  
  

   
   5
1
2
3
4
5
  
  

 

题意：给出一个面积，用一个方格的边长或对角线画，也就是边长只能由1、sqrt(2)组成问至少多少笔可以画出大于等于这个面积的图形

这个题倒着想啊，思考4笔以上设为x笔最多能画多大的面积，肯定要尽量多的sqrt(2)为边长，以4为周期，显然四的倍数的时候一定能画一个菱形样的正方形，边长为x/4*sqrt(2)，面积也就是为x*x/8，然后依次通过图形就可以找到对4取模余1、余2、余3的公式，余1的图形实际是余0的图形延伸得来，余2的图形的两个边长实际为x/4*sqrt(2)、(x/4+1)*sqrt(2)，余3的图形实际是余2的图形延伸得来……

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<set>
using namespace std;
typedef long long LL;
const int N=1e5;
double data[N];
int main()
{
    for(LL i=4;i<N;i++)
    {
        if(i%4==0) data[i]=(i*i)/8;
        if(i%4==1) data[i]=data[i-1]+i/4-0.5;
        if(i%4==2) data[i]=(i/4)*(i/4+1)*2;
        if(i%4==3) data[i]=data[i-1]+i/4+0.5;
    }
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        cin>>n;
        for(int i=4;i<N;i++)
        {
            if(data[i]>=n)
            {
                cout<<i<<endl;
                break;
            }
        }
    }
    return 0;
}