POJ 2739

来源：互联网发布：地震能被预测吗知乎编辑：程序博客网时间：2024/05/22 00:34
#include <iostream>#include <iomanip>#include <cstdlib>#include <algorithm>#include <fstream>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <ctime>#include <queue>#include <stack>#include <vector>#include <map>#include <set>#include <deque>#include <cstdlib>#include <ctime>#include <time.h>inline int Rand (){ return (rand () << 16) | rand ();}//#define fi first//#define se second//#define mp make_pair//#define sz(x) ( (int) (x).size ())#define abs(x) ((x) < 0 ? -(x) : (x))#define INF 20000000000000000ll//#define sqr(x) ( (x) * (x))//#define all(x) x.begin (), x.end ()//#define files(x) freopen (x".in", "r", stdin); freopen (x".out", "w", stdout);//#define MOD 1000000007//#define y1 google#define eps 1e-9//#define tim ((clock() * 1.0) / CLOCKS_PER_SEC)#define sf scanf#define pf printf#define fup(a,b) for(int i=a;i<=b;i++)#define fdown(a,b) for(int i=a;i>=b;i--)#define min(a,b) a>b?b:a#define max(a,b) a>b?a:b#define FP freopen("a.txt","r",stdin)using namespace std;typedef long long ll;typedef unsigned long long ull;const int maxn=200000+50;ll a[maxn];//set<ll>Save;//map<ll,ll>Map;ll prime[12000];int f[120000];int main(){FP;memset(f,0,sizeof(f));int cur=0;f[0]=f[1]=1;for(int i=2;i<=sqrt(12000+0.5);i++)if(!f[i]){for(int j=i*i;j<12000;j+=i){f[j]=1;}}for(int i=0;i<12000;i++)if(!f[i]) {prime[cur]=i;cur++;}int n;while(sf("%d",&n),n){ll l,r,sum;l=r=0;sum=prime[0];ll ans=0;while(l<cur&&r<cur){if(sum==n){ans++;sum-=prime[l++];}while(sum<n){sum+=prime[++r];}while(sum>n){sum-=prime[l++];}}if(!ans)cout<<0<<endl;elsecout<<ans<<endl;}return 0;}
0 0