[Silver III] Champernowne Count - 27569문제 링크성능 요약메모리: 109544 KB, 시간: 100 ms분류수학, 정수론제출 일자2025년 2월 7일 02:22:19문제 설명The $n$th Champernowne word is obtained by writing down the first $n$ positive integers and concatenating them together. For example, the $10$th Champernowne word is "12345678910".Given two positive integers $n$ and $k$, count how many of the first $n$ Champernowne words are divisibl..