Logo
(追記) (追記ここまで)

15131번 - Auxiliary Project 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
3 초 512 MB28619016568.465%

문제

Anna has just finished her course project. She has a lot of seven-segment LED displays as leftovers and a small power source. Each display consumes power proportionally to the number of lit segments, e.g. ‘9’ consumes twice more power than ‘7’.

Anna wonders what is the maximum possible sum of digits she is able to achieve, if her power source is able to light n segments, and she wants to light exactly n segments.

입력

The single line of the input contains one integer n — the number of segments that should be lit (2 ≤ n ≤ 106).

출력

Output a single integer — the maximum possible sum of digits that can be displayed simultaneously.

제한

예제 입력 1

4

예제 출력 1

4

예제 입력 2

7

예제 출력 2

11

예제 입력 3

6

예제 출력 3

14

힌트

In the first example, a single ‘4’ should be displayed (‘7’ has greater value, but has only three segments). In the second example ‘4’ and ‘7’ should be displayed, in the third one — two ‘7’s.

출처

ICPC > Regionals > Northern Eurasia > Northwestern Russia Regional Contest > NEERC Northern Subregional 2017 A번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /