hdu 4982 Goffi and Squary Partition
来源:互联网 发布:数据侠客行女主 编辑:程序博客网 时间:2024/05/11 00:58
循环没有取得那个数即可,判断可以使用贪心很好判断,如果最后一个数是j(j<=k-1)则前面数至少为1....j-1,j+1,,,k-1即可,其他的类似。
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;int get(int p){ int k; k=(int )sqrt(p*1.0); for(int i=max(1,k-3);i<=k+3;i++){ if(p==i*i) return 1; } return 0;}int main(){ int j,n,p,k,t; while(cin>>n>>k){ if(n<k*(k+1)/2){ printf("NO\n"); continue; } p=k*(k-1)/2; t=0; for(j=1;j<=n-p;j++){ if(j==k){ if(n-j==(k)*(k-1)/2+1) continue; else{ if(get(n-j)){ t=1; break; } } continue; } if(j>=k){ if(get(n-j)){ t=1; break; } } else{ if(n-j<(j)*(j-1)/2+(k+j+1)*(k-j)/2) continue; if(get(n-j)){ t=1; break; } } } if(t) printf("YES\n"); else printf("NO\n"); }}
0 0
- hdu 4982 Goffi and Squary Partition(构造)
- hdu 4982 Goffi and Squary Partition
- hdu 4982 Goffi and Squary Partition (枚举)
- HDU 4982 Goffi and Squary Partition
- HDU 4982 Goffi and Squary Partition(推理)
- Goffi and Squary Partition-HDU-4982 BC.6.B
- hdu 4982 Goffi and Squary Partition(BestCoder Round #6)
- hdu 4982 Goffi and Squary Partition (想法题)
- HDU 4982 Goffi and Squary Partition(枚举)
- HDU 4982/BC 6B Goffi and Squary Partition
- HDU-4982-Goffi and Squary Partition【贪心】【构造】
- hdu 4982 Goffi and Squary Partition(思路)
- 【杂题】 HDOJ 4982 Goffi and Squary Partition
- HDOJ 4982 Goffi and Squary Partition
- HDU4982 Goffi and Squary Partition
- [BestCoder Round #6] hdu 4982 Goffi and Squary Partition(构造)
- HDU 4982 Goffi and Squary Partition(BestCoder Round #6 1002)
- 【CUGBACM15级BC第六场 B】hdu 4982 Goffi and Squary Partition
- ping不通
- SAP学习4-OPEN SQL
- vmware 10.03不能设定共享文件夹的解决办法
- linux下root密码修改方法
- jsp标签引用及foreach空格
- hdu 4982 Goffi and Squary Partition
- 135 - ZOJ Monthly, August 2014 - HMachine
- Ubuntu下脚本自启动方法
- ScrollView中嵌套ListView
- 浅谈HTTP中Get与Post的区别(转)
- 微博推荐算法简述<转>
- 20140825
- shared pool与log buffer学习(五)
- zoj 3805 Machine(ZOJ Monthly, August 2014 - H)