题目:http://acm.hdu.edu.cn/showproblem.php?pid=2566
AC代码(C++):
#include <iostream> #include <queue> #include <set> #include <string> #include <algorithm> #include <string.h> #include <math.h> #define INF 0x3f3f3f3f #define eps 1e-8 typedef unsigned long long ULL; using namespace std; int n, m; int ans; int main() { int t; cin >> t; while (t--) { cin >> n >> m; ans = 0; for (int i = 0; i <= m&&i <= n; i++) { for (int j = 0; i + 2 * j <= m&&i + j <= n; j++) { for (int k = 0; i + 2 * j + 5 * k <= m&&i + j + k <= n; k++) { if (i + 2 * j + 5 * k == m&&i + j + k == n) { ans++; break; } } } } cout << ans << endl; } //system("pause"); }总结: 水题, 枚举.