넘치게 채우기

https://codeforces.com/contest/2067/problem/BCodeforces Round 1004(Div.2) - B. Two Large Bags문제 유형: 투 포인터, 그리디, 정렬시간 제한: 1초메모리 제한: 256MB 문제You have two large bags of numbers. Initially, the first bag contains n">n numbers: a1,a2,…,an">a1,a2,…,an, while the second bag is empty. You are allowed to perform the following operations:Choose any number from the first bag and move it to the secon..

https://codeforces.com/contest/2067/problem/ACodeforces Round 1004(Div.2) - A. Adjacent Digit Sums문제 유형: 수학시간 제한: 1초메모리 제한: 256MB 문제You are given two numbers x,y">x,y. You need to determine if there exists an integer n">n such that S(n)=x">S(n)=x, S(n+1)=y">S(n+1)=y.Here, S(a)">S(a) denotes the sum of the digits of the number a">a in the decimal numeral system. 두 정수 x, y를 받습니다. 당신은 S(n) = x, S(n..