fork download
copy 
  1. #include <bits/stdc++.h>
  2. #include <iostream>
  3. #include <set>
  4. #include <vector>
  5. #include <algorithm>
  6. #include <string>
  7. #include <cmath>
  8. using namespace std;
  9. #define ll                     long long
  10. #define _CRT_SECURE_NO_WARNINGS
  11. #define endl                   '\n'
  12. #define time clock_t tStart = clock();
  13. #define show printf("Time taken: %.6fs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC);
  14. #define loop(a,b)             for(int i=a;i<=b;++i)
  15. #define count_1(n)            __builtin_popcountll(n)
  16. #define pb                    push_back
  17. #define f                     first
  18. #define s                     second
  19. #define MOD                   1000000007
  20. #define itoc(c)               ((char)(((int)'0')+c))
  21. #define V                     vector<int>
  22. #define Vl                      vector<ll>
  23. #define pll                   pair<ll,ll>
  24. #define Vp                    vector<pair<int,int>>
  25. #define all(v)                v.begin(),v.end()
  26. #define mid(s,e)              (s+(e-s)/2)
  27. #define tcase()               ll t,n; cin>>t;n=t; while(t--)
  28. #define eb                    emplace_back
  29. #define ull                   unsigned long long
  30. #define minimize              INT_MAX
  31. #define maximize              INT_MIN
  32. #define dsort(a)              sort(a.begin(), a.end(), greater<int>())
  33. #define fr(i,n)               for(ll i=0; i<n; i++)
  34. #define fr1(i,n)              for(ll i=1; i<=n; i++)
  35. #define vp(n)                vector<pair<int,int>>v(n);
  36. #define si                   set <int>
  37.  
  38. void fast(){
  39.     ios_base::sync_with_stdio(0);
  40.     cin.tie(0);
  41.     cout.tie(0);
  42.     //cout.setf(ios::fixed);
  43.     //cout.precision(20);
  44.     #ifndef _offline
  45.     // freopen("mex.in", "r", stdin);
  46.     //freopen("output.txt", "w", stdout);
  47.     #endif
  48. }
  49.  
  50.  
  51.  
  52.  
  53. void HaXn() {
  54.   int n; cin >>n;
  55.   vector<ll> v(n);
  56.   map <ll, ll>mp;
  57.   fr(i,n) cin >> v[i], mp[v[i]]++;
  58.   vector<ll>pow(34);
  59.  
  60.     ll p=1;
  61.     pow[0] =p;
  62.     for (int i =1; i<=33; i++){
  63.         pow[i] = p*=2;
  64.     }
  65.  
  66.     ll count =0;
  67.  
  68.   for (int i =0; i<n; i++){
  69.       bool ok = false;
  70.       mp[v[i]]--;
  71.       for (int j =0; j<=33; j++){
  72.           ll val = pow[j] - v[i];
  73.           if (mp[val]){
  74.               ok = true;
  75.               break;
  76.           }
  77.       }
  78.       if (!ok) count ++;
  79.       mp[v[i]]++;
  80.   }
  81.   cout << count << endl;
  82.  
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89. int main() {
  90.     fast();
  91.     HaXn();
  92. }
Success #stdin #stdout 0s 5292KB
comments ()
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/LwgBU8
language:
C++ (gcc 8.3)
created:
6 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!