Codeforces Round #277.5 (Div. 2)C. Given Length and Sum of Digits...(贪心)
2017-04-22 19:55
841 查看
Description
You have a positive integer m and a non-negative integer s. Your task is to find the smallest and the largest of the numbers that have length m and sum of digits s. The required numbers should be non-negative integers written in the decimal base without leading zeroes.
Input
The single line of the input contains a pair of integers m, s (1 ≤ m ≤ 100, 0 ≤ s ≤ 900) — the length and the sum of the digits of the required numbers.
Output
In the output print the pair of the required non-negative integer numbers — first the minimum possible number, then — the maximum possible number. If no numbers satisfying conditions required exist, print the pair of numbers "-1 -1" (without the quotes).
Sample Input
2 15
0 0
Sample Output
69 96
-1 -1
思路
题意:
求由1-9组成的长度为m且各位数之和为s的最大数和最小数。
#include<bits/stdc++.h> using namespace std; const int maxn = 105; int a[maxn]; bool OK(int m, int s) { return s >= 0 && s <= m * 9; } int main() { int m, s; scanf("%d%d", &m, &s); if (!OK(m, s) || (m > 1 && s == 0)) printf("-1 -1\n"); else { int cnt = 0, sum = s; for (int i = 0; i < m; i++) { for (int j = 0; j < 10; j++) { if (((i > 0 || j > 0) || (m == 1 && j == 0)) && OK(m - i - 1, sum - j)) { sum -= j; a[cnt++] = j; break; } } } for (int i = 0; i < cnt; i++) printf("%d", a[i]); printf(" "); cnt = 0, sum = s; for (int i = 0; i < m; i++) { for (int j = 9; j >= 0; j--) { if (((i > 0 || j > 0) || (m == 1 && j == 0)) && OK(m - i - 1, sum - j)) { sum -= j; a[cnt++] = j; break; } } } for (int i = 0; i < cnt; i++) printf("%d", a[i]); puts("\40"); } return 0; }
相关文章推荐
- Codeforces Round #277.5 (Div. 2)C. Given Length and Sum of Digits...(贪心)
- Codeforces Round #277.5(Div. 2) C. Given Length and Sum of Digits...【贪心】
- Codeforces Round #277.5 (Div. 2)——C贪心—— Given Length and Sum of Digits
- Codeforces Round #277.5 (Div. 2)C——Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2)C——Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2)-C. Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2) C. Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2) C. Given Length and Sum of Digits...
- Codeforces #277.5 (Div. 2) C. Given Length and Sum of Digits...(简单贪心)
- Codeforces - 277.5 (Div. 2)C - Given Length and Sum of Digits...(模拟 or dfs)
- CF 277.5 C.Given Length and Sum of Digits.. 构造
- codeforces489 C. Given Length and Sum of Digits...【贪心】
- codeforces#277.5 C. Given Length and Sum of Digits
- Codeforces 489C - Given Length and Sum of Digits...(贪心)
- CodeForces 489C (贪心) Given Length and Sum of Digits...
- Codeforces Round #379 (Div. 2) B. Anton and Digits(简单贪心)
- codeforces#277.5 C. Given Length and Sum of Digits
- Codeforces Round #288 (Div. 2)C. Anya and Ghosts(模拟+贪心)
- Codeforces Round #277.5 (Div. 2)---B. BerSU Ball (贪心)
- Codeforces Round #292 (Div. 2) C. Drazil and Factorial(贪心YY)