summaryrefslogtreecommitdiff
path: root/introductory_problems/digit_queries.cpp
blob: 008d3f5537b1552ff92b264ce745f56f6e653236 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
// 2431. Digit Queries
#include <bits/stdc++.h>
using namespace std;

long long pow10(int x) {
  long long res = 1;
  for (int i = 0; i < x; i++)
    res *= 10;
  return res;
}

int solve(long long n) {
  if (n < 9)
    return (int)n + 1;
  int len = 1;
  while (pow10(len - 1) * len * 9 < n) {
    n -= 9 * pow10(len - 1) * len;
    len++;
  }
  string s = to_string(pow10(len - 1) + n / len);
  return (int)(s[n % len] - '0');
}

int main() {
  static int q;
  static long long k;
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    scanf("%lld", &k);
    printf("%d\n", solve(k - 1));
  }
}