| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 607268 |
2022-07-26T14:15:06 Z |
xtk |
Rack (eJOI19_rack) |
C++17 |
|
2 ms |
312 KB |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
// #define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const int MAXN=1e6+7;
const int MOD=1e9+7;
long long szybkie_potowanie(long long a, long long n) {
long long w = 1;
while (n>0) {
if (n%2==1) {
w=(w*a)%MOD;
}
a = (a*a)%MOD;
n/=2;
}
return w;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, k;
cin>>n>>k;
k--;
long long ans=1;
for (int i=1; i<=n; ++i) {
if(k%2==1) {
ans = (long long)ans*2+1LL;
ans = ans % MOD;
}
else {
ans = (long long)ans*2;
ans = ans % MOD;
}
k/=2;
}
long long pow = szybkie_potowanie(2, n)-1LL;
cout<<(long long)ans-pow<<'\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Incorrect |
2 ms |
312 KB |
Output isn't correct |
| 15 |
Halted |
0 ms |
0 KB |
- |
