Submission #464107

#	Time	Username	Problem	Language	Result	Execution time	Memory
464107		Sench2006	Rack (eJOI19_rack)	C++14	40 / 100	1 ms	204 KiB

rack

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

#define f first
#define s second
#define mpr make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

#define FOR(i, a, b) for(auto i = a; i < b; i++)
#define FORD(i, a, b) for(auto i = a - 1; i >= b; i--)
#define trav(x, v) for(auto x : v)

#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fileio freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

// --------------- SOLUTION --------------- //

const int MOD = 1e9+7;
int n, k;

int getAns(int n, int k) {
  if (n == 0) return 1;
  if (k % 2 == 1) return getAns(n - 1, (k + 1) / 2);
  if (k % 2 == 0) return (getAns(n - 1, k / 2) + ((1 << (n - 1)) % MOD));
}

void solve() {
    cin >> n >> k;
  	cout << getAns(n, k) << "\n";
}

int main() {
    fastio;
    //fileio;
    int tests = 1;
    // cin >> tests;
    while (tests--) {
        solve();
    }

    return 0;
}

Compilation message (stderr)

rack.cpp: In function 'int getAns(int, int)':
rack.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
   31 | }
      | ^

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 0 / 60