oj.uz

Submission #491806

# Submission time Handle Problem Language Result Execution time Memory
491806 2021-12-04T14:11:46 Z uncripted Rack (eJOI19_rack) C++11
40 / 100
 1 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;
long long const m=1000000007;	
long long a[1000005];
int main(){
	long long n,k;
	cin>>n>>k;

	long long k1=k;
	long long ii=1;
	long long p2[33];
	k1--;
	p2[0]=1;
	for(long long i=1; i<=32; i++){
		p2[i]=(p2[i-1]*2)%m;
	}
	while(k1>0){
		a[ii]=k1%2;
		k1=k1/2;
		ii++;
		//cout<<k1<<"l"<<endl;
	}
	ii=n;
	long long sum=0;
	for(long long i=32; i>=1; i--){
		if(a[i]==1){
			sum+=(p2[ii-i]);
			sum=sum%m;
		}
	}
	
	cout<<(sum+1)%m;
 	
}

Subtask #1
20.0 / 20.0

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

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Incorrect 0 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -