大体题意:
给你一个整数n(n <= 10000),有多少种方案可以把n 写成若干个连续素数之和?
思路:
直接素数打表,然后滑动窗口即可!
当sum 小于目标时,移动右边r。
发现达到目标,直接记录答案。
当sum 大于目标时,直接减左边的l
最后输出ans 即可!
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 100000 + 10;
int vis[maxn];
int prime[maxn],n,cnt;
void init(){
int m = sqrt(maxn + 0.5);
for (int i = 2; i <= m; ++i) if (!vis[i])
for (int j = i * i; j <= maxn; j += i)vis[j] = 1;
for (int i = 2; i < maxn; ++i)if (!vis[i])prime[cnt++] = i;
// for (int i = 0; i < 100; ++i)printf("%d\n",prime[i]);
}
int solve(){
int l =0,r = 0;
int sum = 0;
int ans = 0;
while(1){
while(sum < n && prime[r] <=n){
sum += prime[r++];
}
if (l > r)return ans;
if (sum < n)return ans;
if (sum == n){
++ans;
// printf("%d %d\n",l,r);
sum -= prime[l++];
}
while(sum > n){
sum -= prime[l++];
}
if (sum > n)return ans;
}
}
int main(){
init();
while(scanf("%d",&n) == 1 && n)
printf("%d\n",solve());
return 0;
}