Codeforces Little Dima and Equation 数学题解-白红宇的个人博客

Codeforces Little Dima and Equation 数学题解

发布日期：2021-08-17 08:27:54 浏览次数：14 分类：技术文章

本文共 2309 字，大约阅读时间需要 7 分钟。

Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.

Find all integer solutions x (0 < x < 109) of the equation:

x = b·s(x)a + c,

where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits in the decimal representation of number x.

The teacher gives this problem to Dima for each lesson. He changes only the parameters of the equation: a, b, c. Dima got sick of getting bad marks and he asks you to help him solve this challenging problem.

Input

The first line contains three space-separated integers: a, b, c (1 ≤ a ≤ 5; 1 ≤ b ≤ 10000; - 10000 ≤ c ≤ 10000).

Output

Print integer n — the number of the solutions that you've found. Next print n integers in the increasing order — the solutions of the given equation. Print only integer solutions that are larger than zero and strictly less than 109.

       Sample test(s) 
         input 
3 2 8
         output 
310 2008 13726

http://codeforces.com/contest/460/problem/B

不算难的题目，就是暴力枚举。只是枚举也没有那么easy的，而是须要非常好的逻辑思维能力，才干在这么段时间内想出问题答案的。

思考：

1 怎样找到规律？

2 没有找到规律，暴力搜索？

3 怎样暴力搜索？遍历？以那个值作为遍历？

4 以x作为遍历？范围太大，肯定超时。

5 以s(x)作为遍历，s(x)表示x的数位值相加，一个数字的数位值相加范围肯定是非常少的。故此能够选定这个值遍历。

6 第5步是关键思考转折点，有点逆向思维的味道。暴力枚举也是能够非常巧妙。没那么easy掌握好。

#include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           
            #include 
            
             #include 
             
              #include 
              
               #include 
               #include 
                
                 using namespace std;const int MAX_N = 1000;const int MAX_VAL = 1000000000;int digit[MAX_N];int sumDigits(int num){ int sum = 0; while (num) { sum += num %10; num /= 10; } return sum;}int main(){ int a, b, c, N; long long num; while (scanf("%d %d %d", &a, &b, &c) != EOF) { N = 0; for (int i = 1; i < MAX_N; i++)//enumerate i, which is the sum of digits { num = (long long) pow(double(i), double(a)); num = num * b + c; if (num >= MAX_VAL) break; if (sumDigits((int)num) == i) digit[N++] = (int)num; } sort(digit, digit+N); printf("%d\n", N); for (int i = 0; i < N; i++) { printf("%d ", digit[i]); } if (N) putchar('\n'); } return 0;}

转载于:https://www.cnblogs.com/lxjshuju/p/6898852.html

转载地址：https://blog.csdn.net/weixin_30843605/article/details/95272115 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！

上一篇：C++ string中的几个小陷阱，你掉进过吗？

下一篇：Leetcode Best Time to Buy and Sell Stock III

发表评论

关于作者

喝酒易醉，品茶养心，人生如梦，品茶悟道，何以解忧？唯有杜康！

-- 愿君每日到此一游！

发表评论

最新留言

关于作者

推荐文章