LA11549 - Calculator Conundrum

原创 2015年07月10日 13:46:11

Alice got a hold of an old calculator that can display n digits. She was bored enough to come up with
the following time waster.
She enters a number k then repeatedly squares it until the result over
ows. When the result
over
ows, only the n most signi cant digits are displayed on the screen and an error
ag appears. Alice
can clear the error and continue squaring the displayed number. She got bored by this soon enough,
but wondered:
\Given n and k, what is the largest number I can get by wasting time in this manner?"
Input
The rst line of the input contains an integer t (1  t  200), the number of test cases. Each test case
contains two integers n (1  n  9) and k (0  k < 10n) where n is the number of digits this calculator
can display k is the starting number.
Output
For each test case, print the maximum number that Alice can get by repeatedly squaring the starting
number as described.
Sample Input
2
1 6
2 99
Sample Output
9
99

 

#include <iostream>
#include <stdio.h>
using namespace std;
int next(int n,int k)
{
    long long k2 = (long long)k*k;
    int buf[100],l=0,rt = 0;
    while(k2 > 0)
    {
        buf[l++] = k2%10;
        k2 /= 10;
    }
    //位数不够取最大
    if(n>l)n=l;
    //取n位
    while(n--)
    {
        rt = rt*10 + buf[--l];
    }
    return rt;
}
int main()
{
    int t, n, k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&k);
        int ans = k;
        int k1 = k, k2 = k;
        //每次会缩短两个之间一次操作
        while(true)
        {
            k1 = next(n,k1);
            k2 = next(n,k2);
            ans = max(ans,k2);
            k2 = next(n,k2);
            ans = max(ans,k2);
            if(k1 == k2)break;
        }
        printf("%d\n", ans);
    }
    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

UVA之11549 - Calculator Conundrum

【题目】 Problem C CALCULATOR CONUNDRUM Alice got a hold of an old calculator that can display n dig...

UVA 11549 模拟 Floyed判圈法的应用 Calculator Conundrum

此题很容易想到会出现环,那么就可以想到用map来判重,但是此题还有一种

UVA 11549 Calculator Conundrum

数据会出现循环,使用set来处理循环出现的判断就行了,是一道水题

UVa 11549 Calculator Conundrum 解题报告(判环)

Problem C CALCULATOR CONUNDRUM Alice got a hold of an old calculator that can display n digi...
  • kbdwo
  • kbdwo
  • 2014-07-16 12:44
  • 436

uva 11549 Calculator Conundrum(floyd判圈)

uva 11549 题意:有个老式计算器,每次只能记住一个数字的前n位。现在输入一个整数k,然后反复平方,一直做下去,能得到的最大数是多少。例如,n=1,k=6,那么一次显示:6,3,9,1... ...

【Floyd判圈算法】UVa11549Calculator Conundrum

题目链接 该题在《训练指南》中有,这一道不错的题。 题目描述:对一个数kk,取k∗kk*k的前nn个数。无限操作下去。求其中出现的最大值。 数据范围:1<=n<=91<=n<=9,0<=k<10...

【Jason's_ACM_解题报告】Calculator Conundrum

Calculator Conundrum 解题报告

例题1.19 计算器谜题 UVa11549

1.题目描述:点击打开链接 2.解题思路:本题是一道普通的模拟题,根据题意易知计算器显示的数将会出现循环,因为显示的n位数一共就有限种情况,而平方的次数是无限多的。所以不妨一个个的模拟,每次都看新得到...

The Comments Conundrum

霸气显露无疑!看例子了解Mongodb聚合框架 One of the most common questions we get is: I have a collection of b...

UVA11549(Floyd判圈算法)

题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=28547 解题思路: 此题需要高效算法,根据Floyd判...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)