루미 알고리즘

#1527실버The Clock

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

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

Problem

Timla left home at midnight and came back the next midnight, 24 hours later. During that time, there had been a burglary in the house! In the house, Timla has a digital clock that shows the time in 24-hour format with hours, minutes, and seconds, always six digits. Timla likes to save electricity, so her clock automatically turns off when no one is in the house. To accurately measure how much electricity she saves, she also has a very precise electricity meter. According to this meter, the clock consumed N energy units during the day she was away. Each digit segment in the clock uses one energy unit for every second it is lit. The digits look like the ones in the picture. For example, 27 digit segments are lit when the time is 02:41:35.

(그림은 원문 저장소에서 볼 수 있습니다)

Timla wants to help the police by finding out what time the thief might have broken into the house. You can see from the shoe prints that the thief went into the house once and out once, so the clock cannot have turned on and off multiple times. The clock's display always turns on and off at a whole second and could have turned on as early as 00:00:00 and turned off at the latest after showing 23:59:59.

Write a program that calculates the number of possible times the display could have turned on.

Input

Input consists of an integer N (1 ≤ N ≤ 3 · 10^6).

There is at least one time interval during the day when the clock consumed exactly N energy units.

Output

Print an integer: the number of different times the clock's display could have turned on.

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 ≤ 23
220N ≤ 200
320N ≤ 5000
440No additional constraints.

Explanation of samples

In the first sample, the clock must have been on for exactly one second. It could have been during 11:11:17, 11:17:11, or 17:11:11.

In the second sample, the only possibility is that the clock was on the entire day, from 00:00:00 to 23:59:59.

In the third sample, there are 3196 possible times when the clock could have started. For example, it could have started at 20:02:06 and turned off after showing 20:02:08.

예제

예제 1

입력
13
출력
3

예제 2

입력
2401920
출력
1

예제 3

입력
100
출력
3196

출처 표기

출처: 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). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.