루미 알고리즘

#1526브론즈One Hundred and Eleven Kronor

PO 2021 학교 예선코딩출제 Joakim Blikstad영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

At Tumba paper mill — which is responsible for producing banknotes — the printing press has broken down: it can now only print the digit ”1”. Buying a new printing press costs N Swedish kronor, but unfortunately, the paper mill has completely run out of money. However, since they themselves print banknotes, why not print new money so they can buy the new machine?

Because the broken printing press can only print the digit ”1”, they can only print banknotes with the denominations of 1 krona, 11 kronor, 111 kronor, 1111 kronor, and so on.

The paper mill now wonders how many banknotes they need to print to be able to pay for the new printing press. They want to be able to pay with exact money, i.e., exactly N kronor (it is immoral to print more money than they need), and therefore they want to print as few banknotes as possible. Write a program that calculates the number of banknotes they must print.

Input

The first and only line contains an integer N (1 ≤ N ≤ 10^9), the cost in kronor for the new printing press.

Output

Print an integer: the minimum number of banknotes that need to be printed.

Points

Your solution will be tested on several test case groups. To get the points for a group, it must pass all the test cases in the group.

GroupPoint valueConstraints
120N ≤ 1000
240N ≤ 10^6
340No additional constraints.

Explanation of samples

  • In the first example case, one can use one 1-krona banknote and two 11-kronor banknotes.
  • In the second example case, one can use one of each 1-, 11-, 111-, 1111-, and 11111-krona banknote.

예제

예제 1

입력
23
출력
3

예제 2

입력
12345
출력
5

예제 3

입력
282828
출력
28

출처 표기

출처: Programmeringsolympiaden 2021년 학교 예선 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.