[BOJ 15131] Auxiliary Project

View as PDF

Submit solution

Points: 2
Time limit: 3.0s
Memory limit: 512M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

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’.</p>

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.


Comments

There are no comments at the moment.