codeforces#277.5 C. Given Length and Sum of Digits
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.
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.
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).
2 15
69 96
3 0
-1 -1
#include<cstdio> #include<cstring> #include <iostream> #include<algorithm> using namespace std; int m,s; int main() { while(~scanf("%d%d",&m,&s)) { if((s<1&&m>1)||s>m*9) { cout<<-1<<" "<<-1<<endl; continue; } for(int i=m-1,k=s;i>=0;i--) { int j=max(0,k-9*i); if(j==0&&i==m-1&&k) j=1;//k!=0非常关键。当数据为1 0时,若k=0则此时要输出0 cout<<j; k-=j; } cout<<" "; for(int i=m-1,k=s;i>=0;i--) { int j=min(9,k); cout<<j; k-=j; } } return 0; }
posted on 2017-04-24 13:05 cynchanpin 阅读(169) 评论(0) 编辑 收藏 举报