Submission #237663

#	Time	Username	Problem	Language	Result	Execution time	Memory
237663		tb_03	Rack (eJOI19_rack)	C++14	40 / 100	5 ms	384 KiB

rack

#include <iostream>
 
using namespace std;
typedef unsigned long long ll;
 
const ll modulo = 1000000007;
int n, k;
bool ans[1000005];
 
void recursiva(int level, int casacos)
{
  if (level == n)
    return;
 
  if (casacos % 2 == 0)
    recursiva(level + 1, casacos / 2);
  else
  {
    ans[level] = true;
    recursiva(level + 1, (casacos - 1) / 2);
  }
}
 
int main()
{
  cin >> n >> k;
  recursiva(0, k - 1);
  ll res = 0;
 
  for (int i = 0; i < n; i++)
    res = ((res << 1) | ans[i]) % modulo;
 
  cout << res + 1 << endl;
  return 0;
}

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