Codeforces Round #384 (Div. 2) 743B Chloe and the sequence
来源:互联网 发布:ubuntu tomcat 配置 编辑:程序博客网 时间:2024/05/16 04:59
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.
题意:找出数列的规律,然后问你第k位是哪个数字。
没啥好说的。可以标记一下2,3,4的位置。你会发现它们都是2的次方。根据这个可以很容易的找到规律。
上代码:
#include<bits/stdc++.h>using namespace std;#define LL long longint main(){ LL n,k; while(~scanf("%lld %lld",&n,&k)) { LL temp=1; for(int i=1; i<=n; i++) { temp*=2; if(k%temp) { printf("%d\n",i); break; } } } return 0;}
- Codeforces Round #384 (Div. 2) B Chloe and the sequence
- Codeforces Round #384 (Div. 2) B. Chloe and the sequence
- Codeforces Round #384 (Div. 2) 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 找规律
- Codeforces Round #384 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
- 【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-743B-Chloe and the sequence(二进制思维题)
- Codeforces Round #384(Div. 2)D. Chloe and pleasant prizes【树形dp】
- poj1751 Highway (Prim)
- php mcrypt扩展安装
- 通用属性配置文件(Generic Attribute profile,GATT)
- shell脚本编写彩色进度条
- 智能音乐搜索功能实现(二)
- Codeforces Round #384 (Div. 2) 743B Chloe and the sequence
- 实战:MySQL Sending data导致查询很慢的问题详细分析
- 网站开发注意事项下篇
- MySQL新建存储过程出现:ERROR 1558 (HY000): Column count of mysql.proc is wrong. Expected 20, found 16. Create
- java之yield(),sleep(),wait()区别详解
- React Native中样式表中的一些样式属性
- 2017最新在linux上搭建hustOJ(ubuntu系统)
- 【Ex.】打印出菱形图案的简易方法
- 列表页 删除操作(单选/多选)