codeforce B. Chloe and the sequence (递归)
来源:互联网 发布:python怎么发音 编辑:程序博客网 时间:2024/06/08 12:43
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 to1. 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!
The only line contains two integers n andk (1 ≤ n ≤ 50,1 ≤ k ≤ 2n - 1).
Print single integer — the integer at the k-th position in the obtained sequence.
3 2
2
4 8
4
In the first sample the obtained sequence is [1, 2, 1, 3, 1, 2, 1]. The number on the second position is2.
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 is4.
给定一个整数 n ,操作 n-1 次后,问第 k 位是多少。操作要求,必须把下一个置入序列的数字作为下一次操作结果后序列的 中间。
示例:
1 初始化
1 2 1置入 2
1 2 1 3 1 2 1置入 3
1 2 1 3 1 2 1 4 1 2 1 3 1 2 1置入 4
1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1置入 5
#include<bits/stdc++.h>using namespace std;typedef long long ll;int work(ll n,ll k){ll p=pow(2,n-1);if(k>p) work(n-1,k-p);else if(k<p) work(n-1,k);else return n;}int main(){ll n,k;cin>>n>>k;cout<<work(n,k)<<endl;return 0;}
- codeforce B. Chloe and the sequence (递归)
- B. Chloe and the sequence
- codeforces 743 B Chloe 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
- 【47.40%】【codeforces 743B】Chloe and the sequence
- Codeforces Round #384 (Div. 2) B Chloe and the sequence
- Codeforces Round #384 B. Chloe and the sequence
- codeforces 743 B. Chloe and the sequence (规律题)
- Codeforces Round #384 (Div. 2) B. Chloe and the sequence
- Chloe and the sequence CodeForces
- Chloe and the sequence CodeForces
- Codeforces-743B-Chloe and the sequence(二进制思维题)
- Codeforces Round #384(Div. 2)B. Chloe and the sequence【思维+lowbit】
- Codeforces Round #384 (Div. 2) B. Chloe and the sequence 找规律
- 老僧长谈设计模式-11-原型模式
- caffe笔记4——c++接口
- 20161217
- 玲珑杯-1057-Private Value【思维】【map】
- SqlServer安装遇到的问题几则以及解决办法
- codeforce B. Chloe and the sequence (递归)
- vi/vim基本使用方法
- 【jzoj4922】【环】
- 利用TextInputLayout实现hint浮动显示(二)
- 嵌入式开发中的细节
- 读取文件,到标准输入流(c语言 和 c++版)
- 具有单选标记的菜单;auto关键字;CheckMenuRadioItem函数
- 数据结构-循环链表
- 【ife】任务六:通过HTML及CSS模拟报纸排版