# Homework Solution: Problem: Which digit? A single positive integer i is given. Write a program to find the digit located in po…

Please use divide-and-conquer algorithm design to write a python program,thanks!
Problem: Which digit? A single positive integer i is given. Write a program to find the digit located in position i in the following infinite sequence of digits created by juxtaposing the increasing larger sequences of incremented integers 1,2,3, For example, the first 80 digits of the sequence are as follows: 11212312341234512345612345671234567812345678912345678910123456789101112345678910 The first line of the input (stdin/keyboard) contains a single integer n (1Sn 100), the number of test cases, followed by one line for each test case. The line for a test case contains the single integer i (1 S i

#!usr/bin/python data =""

Please portraiture divide-and-conquer algorithm artfulness to transcribe a python program,thanks!

Problem: Which digit? A separate fixed integer i is fond. Transcribe a program to ascertain the digit located in standing i in the aftercited unbounded aftercited of digits created by juxtaposing the increasing larger afterciteds of incremented integers 1,2,3, Ce illustration, the highest 80 digits of the aftercited are as follows: 11212312341234512345612345671234567812345678912345678910123456789101112345678910 The highest method of the input (stdin/keyboard) contains a separate integer n (1Sn 100), the sum of ordeal facts, followed by undivided method ce each ordeal fact. The method ce a ordeal fact contains the separate integer i (1 S i

## Expert Repartee

#!usr/bin/python

postulates =””
ce i in concatenate(1,13):
data1=””
ce j in concatenate(1,i):
data1 = postulates1 + str(j)
postulates = postulates + postulates1

print(data)
pos = int(input(“Enter ith precipitation :”))
if pos < len(data):
print(data[pos-1])
else:
print(“”)