CodeForces - 192A Funky Numbers

最新推荐文章于 2022-03-28 11:02:27 发布

十二分热爱

最新推荐文章于 2022-03-28 11:02:27 发布

阅读量263

点赞数

本文链接：https://blog.csdn.net/weixin_41988545/article/details/81257779

版权

二分专栏收录该内容

5 篇文章 0 订阅

订阅专栏

As you very well know, this year's funkiest numbers are so called triangular numbers (that is, integers that are representable as , where k is some positive integer), and the coolest numbers are those that are representable as a sum of two triangular numbers.

A well-known hipster Andrew adores everything funky and cool but unfortunately, he isn't good at maths. Given number n, help him define whether this number can be represented by a sum of two triangular numbers (not necessarily different)!

Input

The first input line contains an integer n (1 ≤ n ≤ 109).

Output

Print "YES" (without the quotes), if n can be represented as a sum of two triangular numbers, otherwise print "NO" (without the quotes).

Examples

Input

Output

YES

Input

Output

NO

Note

In the first sample number .

In the second sample number 512 can not be represented as a sum of two triangular numbers.

先遍历一遍找出第一个数

然后根据第一个数二分搜索第二个数，

如果不成功就继续找第一个数

#include <iostream>
#include<cstdio>
#include<cmath> 
using namespace std;
typedef long long ll;
int main(){
	ll n;
	while(scanf("%lld",&n)!=EOF)
	{
	ll num=2*n;ll flag=0;
	for(ll i=1;i<sqrt(2*n+1);i++)
	{
		if(i*i+i>num)break;
		ll res=num-i*i-i;
		ll left=1;ll right=num;
		while(left<=right)
		{
			ll mid=(left+right)/2;
			if(mid*mid+mid>res)right=mid-1;
			else if(mid*mid+mid==res){
			flag=1;break;	
			}
			else left=mid+1;
		}
		if(flag)break;
		
	}
	if(flag) printf("YES\n");
	else printf("NO");	
	}
	return 0;	
}