CodeforcesRound#277.5(Div.2)(C题)_html/css_WEB-ITnose
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了CodeforcesRound#277.5(Div.2)(C题)_html/css_WEB-ITnose,小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含2754字,纯文字阅读大概需要4分钟。
内容图文
![CodeforcesRound#277.5(Div.2)(C题)_html/css_WEB-ITnose](/upload/InfoBanner/zyjiaocheng/400/ecd8636b24b34f3a8ba38db423c9555c.jpg)
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
#include#include #include using namespace std;bool can(int m, int s){ if(s >= 0 && 9*m >= s) return true; else return false;}int main(){ int m,s; cin>>m>>s; if(!can(m,s)) { cout<<"-1"<<" "<<"-1"<<endl; return 0; } if(m == 1) { if(s >= 10) { cout<<"-1"<<" "<<"-1"<<endl; } else cout<<s<<" "<<s<<endl; } else { if(s == 0) cout<<"-1"<<" "<<"-1"<<endl; else { string minn, maxn; int sum = s; for(int i = 1; i <= m; i++) for(int j = 0; j < 10; j++) { if((j > 0 || (j == 0 && i > 1) ) && can(m - i, sum - j)) { minn += char('0' + j); sum -= j; break; } } sum = s; for(int i = 1; i <= m; i++) for(int j = 9; j >= 0; j--) { if(can(m - i, sum - j)) { maxn += char('0' + j); sum -= j; break; } } cout<<minn<<" "<<maxn<<endl; } } return 0;}
内容总结
以上是互联网集市为您收集整理的CodeforcesRound#277.5(Div.2)(C题)_html/css_WEB-ITnose全部内容,希望文章能够帮你解决CodeforcesRound#277.5(Div.2)(C题)_html/css_WEB-ITnose所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。