func_code_string: #include <bits/stdc++.h>   using namespace std;   long long cnk[50][50] = {1};   long long calc(long long mask, long long mx, int cnt, int n) {     if (mask > mx) return 0;     if (cnt == 0) return 1;     if (cnt > n + 1) return 0;     if (mask + (1LL << (n + 1)) - 1 <= mx) return cnk[n + 1][cnt];     return calc(mask + (1LL << n), mx, cnt - 1, n - 1) +            calc(mask, mx, cnt, n - 1);   }   bool solve() {     long long n, t;     if (!(cin >> n >> t)) return false;     if ((t - 1) & t) {       printf( 0 n );       return true;     }     int cnt = 0;     for (; t; t /= 2, cnt++)       ;     for (int i = 1; i < 50; ++i)       for (int j = 0; j <= i; ++j) {         cnk[i][j] = 0;         if (j > 0) cnk[i][j] += cnk[i - 1][j - 1];         if (j < i) cnk[i][j] += cnk[i - 1][j];       }     long long ans = calc(0, n + 1, cnt, 60);     if (cnt == 1) ans--;     cout << ans << endl;     return true;   }   int main() {     solve();     return 0;   }   