Round G 2019 - Kick Start 2019

#include<bits/stdc++.h>

using namespace std;
#define _for(i,a,b) for(int i = (a); i < (b); i++)
#define _rep(i,a,b) for(int i = (a); i <= (b); i++)
const int N = 1e5+100;
int a[N],b[N],vis[N];

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t,n,m,q,kase = 1; cin >>t ;
    while(t--) {
        cin >> n >> m >> q; int x,cnt = 0;
        memset(vis, 0, sizeof(vis));
        _for(i,0,m) cin >> x, vis[x] = 3;
        _for(i,0,q) {
            cin >> x;
            for(int j = x; j <= n; j += x)
                if(vis[j] != 3) cnt++;
        }
        
        cout << "Case #"<< kase++ << ": ";
        cout << cnt << endl;
    }
    return 0;
}

#include<bits/stdc++.h>
  
using namespace std;
  
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;

#ifdef __LOCAL_DEBUG__
# define _debug(fmt, ...) fprintf(stderr, "[%s] " fmt "\n",     __func__, ##__VA_ARGS__)
#else
# define _debug(...) ((void) 0)
#endif

#define IN freopen("B.in", "r", stdin)
#define OUT freopen("B.out", "w", stdout)
#define scd(x) scanf("%d", &x)
#define scld(x) scanf("%lld", &x)
#define scs(x) scanf("%s", x)
#define mp make_pair
#define pb push_back
#define sqr(x) (x) * (x)
#define prcas printf("Case #%d: ", cas)
#define pncas printf("Case #%d:\n", cas)
#define lowbit(x) ((x) & (-(x)))
#define fi first
#define se second
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vi;

const int maxk = 51;
int cnt[65][2];
int n, T;
LL m, ans, ret[65][2], suf[65];

int main()
{    
    scd(T);
    for(int cas = 1; cas <= T; ++ cas)
    {
        for(int i = 0; i <= maxk; ++ i) cnt[i][0] = cnt[i][1] = 0;
        scanf("%d%lld", &n, &m);
        while(n --)
        {
            LL x; scanf("%lld", &x); ans = 0;
            for(int i = 0; i <= maxk; ++ i, x >>= 1) cnt[i][x & 1] ++;
        }
        for(int i = 0; i <= maxk; ++ i) 
            ret[i][0] = 1ll * cnt[i][1] * (1ll << i), ret[i][1] = 1ll * cnt[i][0] * (1ll << i);
        suf[0] = min(ret[0][0], ret[0][1]); 
        for(int i = 1; i <= maxk; ++ i) 
            suf[i] = suf[i - 1] + min(ret[i][0], ret[i][1]);
        for(int i = maxk; i >= 0 && m >= 0; -- i)
        {
            LL t = 0; if(i > 0) t = suf[i - 1];
            if(ret[i][1] + t <= m)
            {
                ans |= 1ll << i;
                m -= ret[i][1];
            }else m -= ret[i][0];
        }
        if(m < 0) ans = -1;
        prcas; printf("%lld\n", ans);
    }
    return 0;
}
/*
Input 
4
3 27
8 2 4
4 45
30 0 4 11
1 0
100
6 2
5 5 1 5 1 0

  
Case #1: 12
Case #2: 14
Case #3: 100
Case #4: -1
*/

  #include<bits/stdc++.h>
  using namespace std;
  #define rep(x,y) for(long long i =x;i<=y;i++)
  #define pb push_back
  #define mp make_pair
  #define ALL(x) (x).begin(),(x).end()
  #define FastIO  ios_base::sync_with_stdio(false); cin.tie(NULL);
  typedef long long ll;
  typedef pair< ll, ll> pll;
  typedef vector< ll > vll;
  typedef map < ll, ll > mll;

int main()
{
  ll i,j,t,test,ans,n,num,s1,s2,a[30],b[30],h,ways;
  test=1;
  cin >> t;
  while(t--)
  {
    cout << "Case #" << test << ": " ;
    ans=0;
    test++;
    cin >> n >> h;
    rep(1,n)
      cin >> a[i];
    rep(1,n)
      cin >> b[i];
    ways= pow(3,n)-1;
    rep(0,ways)
    {
      num=i;
      j=1;
      s1=0;
      s2=0;
      while(j<=n)
      {
        if(num%3==0)
        {
          s1+=a[j];
        }
        else if(num%3==1)
          s2+=b[j];
        else
        {
          s1+=a[j];
          s2+=b[j];
        }
        num/=3;
        j++;
      }
    //  cout << s1 << " " << s2 << endl;
      if(s1>=h && s2>=h)  ans++;
    }
    cout << ans << endl;
  }
  return 0;
}