【Codeforces 743 BChloe and the sequence 】
来源:互联网 发布:淘宝手机店铺收藏地址 编辑:程序博客网 时间:2024/04/29 12:45
B. Chloe and the sequence
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Chloe, the same as Vladik, is a competitive programmer. She didn’t have any problems to get to the olympiad like Vladik, but she was confused by the task proposed on the olympiad.
Let’s consider the following algorithm of generating a sequence of integers. Initially we have a sequence consisting of a single element equal to 1. Then we perform (n - 1) steps. On each step we take the sequence we’ve got on the previous step, append it to the end of itself and insert in the middle the minimum positive integer we haven’t used before. For example, we get the sequence [1, 2, 1] after the first step, the sequence [1, 2, 1, 3, 1, 2, 1] after the second step.
The task is to find the value of the element with index k (the elements are numbered from 1) in the obtained sequence, i. e. after (n - 1) steps.
Please help Chloe to solve the problem!
Input
The only line contains two integers n and k (1 ≤ n ≤ 50, 1 ≤ k ≤ 2n - 1).
Output
Print single integer — the integer at the k-th position in the obtained sequence.
Examples
Input
3 2
Output
2
Input
4 8
Output
4
Note
In the first sample the obtained sequence is [1, 2, 1, 3, 1, 2, 1]. The number on the second position is 2.
In the second sample the obtained sequence is [1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1]. The number on the eighth position is 4.
不该打着4级的旗号~不做练习的~不做点题总感觉缺点什么~
思路~数列是对称的,N- 1次变换后,数列长度为M = 2 ^ N - 1,每次对 M取半即可~看代码更容易懂~
AC代码:
#include<cstdio>typedef long long LL;LL KSM(LL y){ LL cut = 1,sum = 2; while(y){ if(y & 1) cut *= sum; sum *= sum; y >>= (LL)1; } return cut;}int main(){ LL N,K; scanf("%I64d %I64d",&N,&K); LL M = KSM(N) - 1; while(M > 1){ if(K > M / 2 + 1) K -= M / 2 + 1; if(K == M / 2 + 1) break; N--; M /= 2; } printf("%I64d\n",N); return 0;}
- 【Codeforces 743 BChloe and the sequence 】
- Codeforces 743B Chloe and the sequence
- 743B. Chloe and the sequence codeforces
- Codeforces 743B-Chloe and the sequence
- ***CodeForces - 743B Chloe and the sequence
- Chloe and the sequence CodeForces
- Chloe and the sequence CodeForces
- 【47.40%】【codeforces 743B】Chloe and the sequence
- codeforces 743 B Chloe and the sequence(递归)
- codeforces 743 B. Chloe and the sequence (规律题)
- CodeForces 438D The Child and Sequence
- 【Codeforces 438 D】The Child and Sequence
- Codeforces-743B-Chloe and the sequence(二进制思维题)
- Codeforces Round #384 (Div. 2) 743B Chloe and the sequence
- codeforces 336C Vasily the Bear and Sequence
- Codeforces Round #250 (Div. 1) D. The Child and Sequence
- Codeforces Round #250 (Div. 1) D. The Child and Sequence
- Codeforces 336C Vasily the Bear and Sequence 暴力
- python数字图像处理(5):图像的绘制
- strlen和sizeof的区别
- Android API翻译之WebChromeClient(未完工)
- 如何参与Linux内核社区开发
- Maven学习笔记(六)-使用Eclipse创建Maven WEB项目以及运行项目的几种方式
- 【Codeforces 743 BChloe and the sequence 】
- Android如何隐藏掉前台服务的通知栏,史上详细的资料!
- cookie/session机制详解
- CodeForces - 441B -Valera and Fruits
- 常用事件示例
- Spark streaming 采用直接读kafka 方法获取数据
- 后端开发面试经验分享
- ngnix 一 入门指南
- sharepreferen保存和读取用户