CF C. Classroom Watch【枚举】
来源:互联网 发布:js如何获取对象的长度 编辑:程序博客网 时间:2024/05/16 17:27
C. Classroom Watch
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard 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
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.
#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;typedef long long ll;int calc(int x){ int s = 0; while (x) { s += x % 10; x /= 10; } return s;}int ans[100010];int main(){ int n; scanf("%d", &n); int i; int t = 0; for (i = max(1, n - 100); i <= n; i++) if (i + calc(i) == n) ans[++t] = i; printf("%d\n", t); for (i = 1; i <= t; i++) printf("%d\n", ans[i]); return 0;}
- CF C. Classroom Watch【枚举】
- Codeforces 876C Classroom Watch
- Codeforces 876 C Classroom Watch
- CodeForces 876C Classroom Watch
- codeforces 876C Classroom Watch
- CodeForces-876C Classroom Watch
- Codeforces Round #441 (Div. 2)C. Classroom Watch(枚举+脑子)
- Codeforces Round #441 div2 C. Classroom Watch
- Codeforces Round #441 C. Classroom Watch
- C. Classroom Watch(思路)---codeforces
- Codeforces 876 C Classroom Watch 基础数学,暴力
- codeforces875A Classroom Watch
- Codeforces875A-Classroom Watch
- A. Classroom Watch
- Codeforces 875A Classroom Watch
- CodeForces 875A Classroom Watch
- Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) C. Classroom Watch
- Codeforces 875A Classroom Watch 题解
- VariantClear 和 VariantInit 函数
- contains( )方法
- 类似SCSF中EventBroker解耦事件调用方和接受方,打破"+="带来的耦合
- 【知识】UML类图与类的关系详解
- js调试技巧 实用
- CF C. Classroom Watch【枚举】
- Docker容器实战-容器的网络及数据
- 伸展树 模板(指针+数组)
- WebRequestInterceptor WebRequestInterceptor的应用
- iOS将状态栏设置成白色
- IIS停止服务 报错Connections_Refused
- C++ STL replace()函数常用用法详解
- 纯CSS实现瀑布流布局
- HTTP协议请求响应过程和HTTPS工作原理