Codeforces 743B-Chloe and the sequence
来源:互联网 发布:买房子上哪个网站知乎 编辑:程序博客网 时间:2024/06/04 18:03
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!
The only line contains two integers n and k (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 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.
题意:
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
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 6 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置入 6
给定一个整数 n ,操作 n-1 次后,问第 k 位是多少。操作如上。解题思路:递归求解
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <stack>#include <queue>#include <vector>#include <map>using namespace std;#define ll long longll mypow(ll x,ll y){ ll sum=1; while(y) { if(y&1) sum*=x; y/=2; x*=x; } return sum;}int main(){ ll n,k; while(~scanf("%lld %lld",&n,&k)) { ll i,x; for(i=n;;i--) { x=mypow(2,i-1); if(k>x) k=x-(k-x); else if(k==x) break; if(k==1||k==2) break; } if(k==1||k==2) printf("%lld\n",k); else printf("%lld\n",i); } return 0;}
- Codeforces 743B Chloe and the sequence
- 743B. Chloe and the sequence codeforces
- Codeforces 743B-Chloe and the sequence
- ***CodeForces - 743B Chloe and the sequence
- 【47.40%】【codeforces 743B】Chloe and the sequence
- codeforces 743 B Chloe and the sequence(递归)
- codeforces 743 B. Chloe and the sequence (规律题)
- Chloe and the sequence CodeForces
- Chloe and the sequence CodeForces
- B. Chloe and the sequence
- Codeforces Round #384 (Div. 2) B Chloe and the sequence
- Codeforces Round #384 B. Chloe and the sequence
- Codeforces Round #384 (Div. 2) B. Chloe and the sequence
- Codeforces-743B-Chloe and the sequence(二进制思维题)
- Codeforces Round #384 (Div. 2) 743B Chloe and the sequence
- 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 找规律
- 分治 求逆序对数
- 渐变
- Android实战之Toolbar返回上级Activity崩溃的解决办法
- AngularJS的模块
- web
- Codeforces 743B-Chloe and the sequence
- 文本格式化
- ARM Ubuntu设置系统时间
- 2016 UESTC 第八届ACM趣味程序设计竞赛第三场(正式赛)(比赛场)B - 保护果实
- Ubuntu16.04安装Tomcat8.5
- 浅析白盒审计中的字符编码及SQL注入
- Java多线程下载,断点续传
- 访问修饰符
- 凤凰项目 - 笔记