杭电5620 KK's Steel

最新推荐文章于 2016-06-15 18:16:51 发布

hpuzsk

最新推荐文章于 2016-06-15 18:16:51 发布

阅读量388

点赞数

分类专栏：数学简单题文章标签：杭电数学题简单题

本文链接：https://blog.csdn.net/z8110/article/details/50805303

版权

数学同时被 2 个专栏收录

92 篇文章 0 订阅

订阅专栏

简单题

49 篇文章 0 订阅

订阅专栏

KK's Steel

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 510 Accepted Submission(s): 246

Problem Description

Our lovely KK has a difficult mathematical problem:he has a

N(1≤N≤1018) meters steel,he will cut it into steels as many as possible,and he doesn't want any two of them be the same length or any three of them can form a triangle.

Input

The first line of the input file contains an integer

T(1≤T≤10) , which indicates the number of test cases.

Each test case contains one line including a integer

N(1≤N≤1018) ,indicating the length of the steel.

Output

For each test case, output one line, an integer represent the maxiumum number of steels he can cut it into.

Sample Input

1
6

Sample Output

  
  
   
   3


   
   
    
    
     
     Hint
    
    1+2+3=6 but 1+2=3  They are all different and cannot make a triangle.

Source

BestCoder Round #71 (div.2)

Recommend

hujie | We have carefully selected several similar problems for you: 5634 5633 5632 5631 5630

用到斐波那契的性质了，A，B，C属于斐波那契数列里边的数，任意两个不相等，并且A<B<C，所以A + B <= C；

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
__int64 i,j,k,l,m,n,a[11000],p;
int main()
{
	a[1]=1;
	a[2]=2;
	for(i=3;i<=10888;i++)
	a[i]=a[i-1]+a[i-2];
	scanf("%I64d",&p);
	while(p--)
	{
		scanf("%I64d",&n);
		k=0;
			for(i=1;;i++)
		{
			k+=a[i];
			if(k>n)
			break;
		}
		printf("%I64d\n",i-1);
	}
}