题目大意:,1 <= xi <= M, i=1...n(1 <= n <= 6;1 <= M <= 150)
输入:n
M
ki pi(共n行)
输出:整数解的个数
分析:折半搜索+哈希。暴力枚举超时,所以将方程分成两半,先枚举前一半的解,将总值哈希存储,然后枚举后一半看看是否和左值相等,若是则是一个解。
代码:转载自https://blog.csdn.net/ccshijtgc/article/details/80632007
#include<iostream>
#include<cstdio>
#include<cstring>
#include<unordered_map>
using namespace std;
int n,m,ans;
int k[6],p[6];
unordered_map<int, int> hashTable;
int getpow(int x, int p) {//快速幂计算i^p
int tmp = 1;
while(p) {
if(p & 1) tmp *= x;
x *= x;
p >>= 1;
}
return tmp;
}
void leftHalf(int d,int s) { //递归求左表达式的和
if(d == n / 2) {
if(hashTable.count(s) == 0) {
hashTable[s] = 1;
}
else {
hashTable[s] += 1;
}
return;
}
for(int i = 1; i <= m; i++)
leftHalf(d+1,s + k[d] * getpow(i,p[d]));
}
void rightHalf(int d,int s) {
if(d == n) {
s = -s;
if(hashTable.count(s)) {//中间相遇,更新方案数
ans += hashTable[s];
}
return;
}
for(int i = 1; i <= m; i++)
rightHalf(d+1,s + k[d] * getpow(i,p[d]));
}
int main() {
scanf("%d%d",&n,&m);
for(int i = 0; i < n; i++)
scanf("%d%d",&k[i],&p[i]);
leftHalf(0,0);//前半段
rightHalf(n/2,0);//后半段
printf("%d\n",ans);
return 0;
}