Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("sprime.in");
- ofstream fout("sprime.out");
- int n,i,a[100001],p[100001],m=0,s,nr=0,w;
- void Ciurul()
- {
- int j;
- for(i=4; i<=n; i+=2)
- a[i]=1;
- for(i=3; i*i<=n; i+=2)
- if(a[i]==0)
- for(j=i*i; j<=n; j=j+2*i)
- a[j]=1;
- a[1]=1;
- m = 0;
- for(i=1; i<=n; i++)
- if(a[i]==0) p[++m]=i;
- }
- void Rezolvare()
- {
- int j;
- for(i=1;i<=m;i++)
- {
- for(j=i;j<=m;j++)
- {
- w=n-p[i]-p[j];
- if(w>1&&a[w]==0&&w>=p[j])
- nr++;
- }
- }
- fout<<nr<<"\n";
- }
- int main()
- {
- fin>>n;
- Ciurul();
- Rezolvare();
- fout.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement