제출 #1100867

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1100867		vincentbucourt1	Rack (eJOI19_rack)	C++14	40 / 100	1 ms	336 KiB

rack

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

const int MOD = 1e9 + 7;

int N, numIter;

int ans = 0;

long long modular(long long base, long long exp, int mod) {
   long long res = 1;
   while (exp > 0) {
      if (exp % 2 == 1)
         res= (res * base) % mod;
      exp = exp >> 1;
      base = (base * base) % mod;
   }
   return res;
}

signed main() {
    cin >> N >> numIter;

    numIter--;
    for (int i = 0; i <= 20; i++) {
        bool filled = (numIter & (1 << i));
        ans += (modular(2, N - i - 1, MOD)) * filled;
        ans %= MOD;
    }

    cout << (ans + 1) % MOD << "\n";
}

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