Sicily 1028. Hanoi Tower Sequence

最新推荐文章于 2013-10-06 15:40:29 发布

xshengh

最新推荐文章于 2013-10-06 15:40:29 发布

阅读量1.2k

点赞数

分类专栏： sicily 模拟、推理文章标签：找规律

本文链接：https://blog.csdn.net/xshengh/article/details/12320263

版权

sicily 模拟、推理专栏收录该内容

6 篇文章 0 订阅

订阅专栏

国庆刷一刷。汉诺塔序列，其实就是找规律，初始化ans为1。如果数字为奇数，直接输出ans，若为偶数则除2，直到数字为奇数，每除一次ans加1。最后的答案就是ans。

// Problem#: 1028
// Submission#: 2249832
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <stack>
#include <bitset>
using namespace std;

int main(){
    //freopen("in.txt", "r", stdin);
    int t;
    cin >> t;
    for(int k = 1; k <= t; k++){
        if(k != 1)  cout <<endl;
        string s;
        cin >> s;
        if((s[s.size()-1]-'0') % 2 != 0){
            cout <<"Case "<< k << ": "<< 1 <<endl;
            continue;
        }
        int cont = 0;
        while(!s.empty()){
            string tmp = s;
            s.clear();
            int ans = 0, div;
            for(int i = 0; i < tmp.size(); i++){
                ans = ans * 10 + (tmp[i]-'0');
                div = ans / 2;
                ans %= 2;
                if(i == 0 && div == 0)  continue;
                s += char(div+'0');
                //cout << div <<endl;
            }
            //cout << s <<endl;
            if(ans == 1){
                cout <<"Case "<< k << ": "<< cont+1 << endl;
                break;
            }
            cont++;
        }
    }
}