CodeForces 1355 A. Sequence with Digits 暴力剪枝

最新推荐文章于 2021-06-24 15:05:31 发布

Curren.wong

最新推荐文章于 2021-06-24 15:05:31 发布

阅读量144

点赞数 1

分类专栏：算法刷题笔记 # 暴力剪枝文章标签：算法 c++ 数据结构 codeforces

本文链接：https://blog.csdn.net/qq_41729780/article/details/106277204

版权

算法刷题笔记同时被 2 个专栏收录

76 篇文章 3 订阅

订阅专栏

暴力剪枝

4 篇文章 0 订阅

订阅专栏

文章目录

1. 题目描述

1.1. Limit

Time Limit: 2 seconds

Memory Limit: 256 megabytes

1.2. Problem Description

Let’s define the following recurrence: $a_{n+1} = a_{n} + minDigit(a_{n}) \cdot maxDigit(a_{n})$

Here $m i n D i g i t (x)$ and $m a x D i g i t (x)$ are the minimal and maximal digits in the decimal representation of $x$ without leading zeroes. For examples refer to notes.

Your task is calculate $a_{K}$ for given $a_{1}$ and $K$ .

1.3. Input

The first line contains one integer $t$ ( $\le t \le 1000$ ) — the number of independent test cases.

Each test case consists of a single line containing two integers $a_{1}$ and $K$ ( $\le a_{1} \le 10^{18}$ , $\le K \le 10^{16}$ ) separated by a space.

1.4. Output

For each test case print one integer $a_{K}$ on a separate line.

1.5. Sample Input

1.6. Sample Output

1.7. Note

$a_{1} = 487$

$a_{2} = a_{1} + minDigit(a_{1}) \cdot maxDigit(a_{1}) = 487 + \min (4, 8, 7) \cdot \max (4, 8, 7) = 487 + 4 \cdot 8 = 519$

$a_{3} = a_{2} + minDigit(a_{2}) \cdot maxDigit(a_{2}) = 519 + \min (5, 1, 9) \cdot \max (5, 1, 9) = 519 + 1 \cdot 9 = 528$

$a_{4} = a_{3} + minDigit(a_{3}) \cdot maxDigit(a_{3}) = 528 + \min (5, 2, 8) \cdot \max (5, 2, 8) = 528 + 2 \cdot 8 = 544$

$a_{5} = a_{4} + minDigit(a_{4}) \cdot maxDigit(a_{4}) = 544 + \min (5, 4, 4) \cdot \max (5, 4, 4) = 544 + 4 \cdot 5 = 564$

$a_{6} = a_{5} + minDigit(a_{5}) \cdot maxDigit(a_{5}) = 564 + \min (5, 6, 4) \cdot \max (5, 6, 4) = 564 + 4 \cdot 6 = 588$

$a_{7} = a_{6} + minDigit(a_{6}) \cdot maxDigit(a_{6}) = 588 + \min (5, 8, 8) \cdot \max (5, 8, 8) = 588 + 5 \cdot 8 = 628$

1.8. Source

CodeForces 1355 A. Sequence with Digits

2. 解读

直接根据公式进行计算

$a_{n+1} = a_{n} + minDigit(a_{n}) \cdot maxDigit(a_{n})$

但是考虑到数据范围 ( $\le a_{1} \le 10^{18}$ , $\le K \le 10^{16}$ )，不进行剪枝肯定会超时。

我们可以注意到一个规律，就是当 $minDigit(a_{n}) = 0$ 时， $minDigit(a_{n}) \cdot maxDigit(a_{n}) = 0$ ，也就是说，当我们在数字中找到了一个 $0$ ，那么就不再需要进行计算，直接返回 $0$ 即可。

3. 代码

#include <algorithm>
#include <iostream>
using namespace std;

long long n, k;
// 计算结果
long long calculate(long long x)
{
    long long minN = 10, maxX = 0;
    while (x) {
        // 若找到0，则返回
        if (x % 10 == 0) {
            return 0;
        } else {
            minN = min(x % 10, minN);
            maxX = max(x % 10, maxX);
        }
        x /= 10;
    }
    return minN * maxX;
}

int main()
{
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%lld %lld", &n, &k);
        while (--k) {
            if (calculate(n) == 0) {
                break;
            } else {
                n += calculate(n);
            }
        }
        printf("%lld\n", n);
    }
}