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
题意:给两个数m, s,求出位数等于m 且个位数字之和等于s的最小数和最大数。
解题思路:直接贪心的去构造。先判断输出-1,-1的情况:m*9
AC代码:
#include#include #include #include #include #include #include #include
上一篇: 图解MySQL数据库安装与实际操作
下一篇: PS与IR打造兔斯基撞墙动画效果
推荐阅读
-
Codeforces Round #256 (Div. 2) C. Painting Fence(分治贪心)_html/css_WEB-ITnose
-
Codeforces Round #277 (Div. 2)-C. Palindrome Transformation (贪心)_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)C??Given Length and Sum of Digits._html/css_WEB-ITnose
-
Codeforces Round #277 (Div. 2)-C. Palindrome Transformation (贪心)_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)C??Given Length and Sum of Digits._html/css_WEB-ITnose
-
Codeforces Round #280 (Div. 2)-C. Vanya and Exams (贪心)_html/css_WEB-ITnose
-
Codeforces Round #280 (Div. 2)-C. Vanya and Exams (贪心)_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)-B. BerSU Ball (贪心)_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