oj.uz

Submission #809121

# Submission time Handle Problem Language Result Execution time Memory
809121 2023-08-05T17:48:59 Z ThylOne Rack (eJOI19_rack) C++14
100 / 100
 9 ms 7892 KB 
#include<bits/stdc++.h>

using namespace std;
const int MOD = 1000000007;
signed main(){
	long long n,k;cin>>n>>k;
	k--;
	long long ans=1;
	long long add=n;
	vector<long long > power(n+2);
	power[0]=1;
	for(int i =1;i<=n;i++){
		power[i] = 2*power[i-1]%MOD;
	}
	for(int i=0;i<n;i++){
		add--;
		if((k)&1){
			//right
		ans +=power[add];
		ans%=MOD;
		}
		k/=2;
		
	}
	cout<<ans%MOD<<endl;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 9 ms 7892 KB Output is correct