Codeforces Round #277.5 (Div. 2)C??Given Length and Sum of Digits._html/css_WEB-ITnose
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
Input
2 15
Output
69 96
Input
3 0
Output
-1 -1
贪心,考虑最大的时候把数组赋值为9,考虑最小的时候把数组第一位赋值1,其他为赋值0
#include
推荐阅读
-
Codeforces Round #277.5 (Div. 2)(C题)_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)C??Given Length and Sum of Digits._html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)C??Given Length and Sum of Digits._html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)-C_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)(C题)_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)-C. Given Length and Sum of Digits (贪心)_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)-C. Given Length and Sum of Digits (贪心)_html/css_WEB-ITnose