Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- bool prime[10000000];
- void sieve()
- {
- memset(prime, true, sizeof(prime));
- int i, j;
- for( i=2; i<=sqrt(10000000); i++)
- {
- if(prime[i]==true)
- {
- for( j=i*2; j<=10000000; j+=i)
- prime[j]= false;
- }
- }
- }
- int main()
- {
- sieve();
- int tc,cs=1;
- cin >> tc;
- while(tc--){
- long long int in;
- cin >> in;
- int i, res=0;
- for(i=2;i<=in/2;i++){
- if(prime[i] && prime[in-i]){
- if(i > (in-i)){
- break;
- }
- res++;
- }
- }
- cout << "Case " << cs++ << ": " << res << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement