Champernowne Count

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제 설명

예제4

문제

The $n$ th Champernowne word is obtained by writing down the first $n$ positive integers and concatenating them together. For example, the 10th Champernowne word is "12345678910".

Given two positive integers $n$ and $k$ , count how many of the first $n$ Champernowne words are divisible by $k$ .

입력

The single line of input contains two integers, $n$ $(1 \le n \le 10^5)$ and $k$ $(1 \le k \le 10^9)$ .

출력

Output a single integer, which is a count of the first $n$ Champernowne words divisible by $k$ .