zoukankan      html  css  js  c++  java
  • Codeforces C. Classroom Watch

    C. 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 xwritten 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
    21
    output
    1
    15
    input
    20
    output
    0
    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的位数*9到n枚举就行了;

    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    #include<iostream>
    using namespace std;
    
    int n,ans[1000008],res,k;
    
    int main(){
        scanf("%d",&n);
        long long g=9,gg=0;
        while(g<=n){
            g=g*10+9;
            gg++;
        }
        gg+=2;
        for(int i=n-gg*9;i<=n;i++){
            int x=n-i,a=i;
            while(a>0){
                x=x-a%10;
                a=a/10;
            }
            if(x==0){
                res++;
                ans[res]=i;
            }
        }
        printf("%d
    ",res);
        for(int i=1;i<=res;i++)
            printf("%d
    ",ans[i]);
    }
  • 相关阅读:
    8.6 First_value和Last_value
    iOS_第3方类库_側滑选项卡SlideSwitchView
    公开的函数把函数作为參数
    .NET 框架简单介绍
    HDU-3577-Fast Arrangement-区间更新
    拥抱PBO(基于项目的组织)聚焦核心价值创造
    一个使用sbt编译的JNI C++ 的模板
    BestCoder Round #1
    饭统网倒闭:不创新、不放权就是作死 .
    【SSH 基础】浅谈Hibernate关系映射(3)
  • 原文地址:https://www.cnblogs.com/WQHui/p/7683292.html
Copyright © 2011-2022 走看看