zoukankan      html  css  js  c++  java
  • Codeforces Round #384 (Div. 2) B. Chloe and the sequence

    传送门:http://codeforces.com/contest/743/problem/B

    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.

    这就是一道递归题:

    下面是错误代码,在处理数据时发生了溢出,在晚上提交的时候,一次就过了,但是在第二天就被hack了

     1 #include <iostream>
     2 #include <cmath>
     3 using namespace std;
     4 
     5 long long  solve(long long n,long long k){
     6     if(k>1<<n-1)  //在移位的时候发生了溢出,1默认是int型的,应该强制转换一下的
     7        k=k%(1<<n-1);  
     8 
     9     if(k%(1<<(n-1))==0)
    10     return  n;
    11     solve(n-1,k);
    12 }
    13   int main(){
    16     long long n,k;
    17     cin>>n>>k;
    18     cout<<solve(n,k)<<endl;
    19 }

    下面的是正确的代码:

     1 #include <iostream>
     2 #include <cmath>
     3 using namespace std;
     4 
     5 const long long S=1;
     6 long long  solve(long long n,long long k){
     7     if(k>S<<n-1)
     8        k=k%(S<<n-1);
     9 
    10     if(k%(S<<(n-1))==0)
    11     return  n;
    12     solve(n-1,k);
    13 }
    14 
    15 
    16 int main(){
    17     long long n,k;
    18     cin>>n>>k;
    19     cout<<solve(n,k)<<endl;
    20 }
    自己选的路,跪着也要把它走完------ACM坑
  • 相关阅读:
    bzoj3007: 拯救小云公主
    bzoj4316: 小C的独立集
    PostgreSQL Replication之第三章 理解即时恢复(3)
    PostgreSQL Replication之第三章 理解即时恢复(2)
    PostgreSQL Replication之第三章 理解即时恢复(1)
    PostgreSQL Replication之第二章 理解PostgreSQL的事务日志(5)
    PostgreSQL Replication之第二章 理解PostgreSQL的事务日志(4)
    PostgreSQL Replication之第二章 理解PostgreSQL的事务日志(3)
    PostgreSQL Replication之第二章 理解PostgreSQL的事务日志(2)
    PostgreSQL Replication之第二章 理解PostgreSQL的事务日志(1)
  • 原文地址:https://www.cnblogs.com/IKnowYou0/p/6182759.html
Copyright © 2011-2022 走看看