Preparando MOJI

Digits Sequence (Hard Edition)

1000ms 262144K

Description:

Let's write all the positive integer numbers one after another from $$$1$$$ without any delimiters (i.e. as a single string). It will be the infinite sequence starting with 123456789101112131415161718192021222324252627282930313233343536...

Your task is to print the $$$k$$$-th digit of this sequence.

Input:

The first and only line contains integer $$$k$$$ ($$$1 \le k \le 10^{12}$$$) — the position to process ($$$1$$$-based index).

Output:

Print the $$$k$$$-th digit of the resulting infinite sequence.

Sample Input:

7

Sample Output:

7

Sample Input:

21

Sample Output:

5

Informação

Codeforces

Provedor Codeforces

Código CF1177B

Tags

binary searchdivide and conquerimplementation

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:48:39

Relacionados

Nada ainda