This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
vector<bool> kbinari;
int n;
void binari(long long int k){
int i = n-1;
while (k > 0){
if (k%2 == 1) kbinari[i] = true;
else kbinari[i] = false;
k /= 2;
i--;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int k;
cin >> n >> k;
kbinari = vector<bool>(n);
binari(k-1);
long long int ans = 1;
long long int potencia = 1;
for (int i = 0; i < n; i++){
if (kbinari[i] == true){
ans += potencia;
ans %= mod;
}
potencia *= 2;
potencia %= mod;
}
cout << ans << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |