HDU 4982 Goffi and Squary Partition（推理）

本文主要是介绍HDU 4982 Goffi and Squary Partition（推理），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

HDU 4982 Goffi and Squary Partition

思路：直接从完全平方数往下找，然后判断能否构造出该完全平方数，如果可以就是yes，如果都不行就是no，注意构造时候的判断，由于枚举一个完全平方数，剩下数字为kk，构造的时候要保证数字不重复

代码：

#include <cstdio>
#include <cstring>
#include <cmath>int n, k;bool judge(int num) {int yu = num * num;int kk = n - yu;if (kk == 0) return false;int sum = 0;int cnt = 0;for (int i = 0; i < k - 2; i++) {cnt++;if (cnt == kk) cnt++;sum += cnt;}if (sum + kk >= n) return false;int need = n - sum - kk;if (need <= cnt) return false;cnt++;if (kk == cnt || kk == cnt + 1) {if (need == kk) return false;}return true;
}bool solve() {int m = sqrt(n * 1.0);for (int i = m; i >= 1; i--) {if (judge(i)) {return true;}}return false;
}int main() {while (~scanf("%d%d", &n, &k)) {if (solve()) printf("YES\n");else printf("NO\n");}return 0;
}

这篇关于HDU 4982 Goffi and Squary Partition（推理）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---