CF 441 div1a

最新推荐文章于 2024-01-15 12:13:32 发布

原创最新推荐文章于 2024-01-15 12:13:32 发布 · 175 阅读

0 ·

CC 4.0 BY-SA版权

脑洞专栏收录该内容

13 篇文章

订阅专栏

题目:

A. Classroom Watch
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the answer to the arithmetic task for first-graders. In the textbook, a certain positive integer x was given. The task was to add x to the sum of the digits of the number x written in decimal numeral system.

Since the number n on the board was small, Vova quickly guessed which x could be in the textbook. Now he wants to get a program which will search for arbitrary values of the number n for all suitable values of x or determine that such x does not exist. Write such a program for Vova.
Input

The first line contains integer n (1 ≤ n ≤ 109).
Output

In the first line print one integer k — number of different values of x satisfying the condition.

In next k lines print these values in ascending order.
Examples
Input

Output

1
15

Input

Output

Note

In the first test case x = 15 there is only one variant: 15 + 1 + 5 = 21.

In the second test case there are no such x.

题意:
给你一个数n,让你找出所有数他本身加上他各位上的数等于n.
思路:
这题说实话没有想到,一开始以为打表,但并没有发现什么规律,思路是因为数的范围是10^10,所以一个数最大是999999999.
代码:

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<string.h>
using namespace std;
typedef long long LL;
vector<LL>ans;
LL n;
int main()
{
    cin >> n;
    for (LL i = max(n - 100,(LL)0); i <= n; i++)
    {
        LL temp = i;
        LL a = temp;
        while (temp)
        {
            a += temp % 10;
            temp /= 10;
        }
        if (a == n)
            ans.push_back(i);
    }
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i++)
        cout << ans[i] << ' ';
    cout << endl;
    return 0;
}