oj.uz

Submission #533300

# Submission time Handle Problem Language Result Execution time Memory
533300 2022-03-05T10:27:50 Z stasico Rack (eJOI19_rack) C++17
100 / 100
 10 ms 316 KB 
#include <bits/stdc++.h>
using namespace std;

  const int Mod=1e9+7;

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n,i,w=1,p=1;
	long long k;
	cin >> n >> k; --k;
	for (i=1; i<=n; i++)
   {
		if (k%2==0) w=((long long)2*w)%Mod;
		  else w=((long long)2*w+1)%Mod;
		k=k/2;
	 }
	for (i=1; i<=n; i++) p=((long long)2*p)%Mod;
	cout << (w-(p-1)+Mod)%Mod << endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 10 ms 308 KB Output is correct