# 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 authentication divide-and-conquer algorithm contrivance to transcribe a python program,thanks! Problem: Which digit? A sole fixed integer i is absorbed. Transcribe a program to meet the digit located in comcomaspect i in the aftercited unbounded series of digits created by juxtaposing the increasing larger seriess of incremented integers 1,2,3, Coercion development, the highest 80 digits of the series are as follows: 11212312341234512345612345671234567812345678912345678910123456789101112345678910 The highest series of the input (stdin/keyboard) contains a sole integer n (1Sn 100), the sum of examination predicaments, followed by undivided series coercion each examination predicament. The series coercion a examination predicament contains the sole integer i (1 S i

## Expert Solution

#!usr/bin/python

grounds =””
coercion i in file(1,13):
data1=””
coercion j in file(1,i):
data1 = grounds1 + str(j)
grounds = grounds + grounds1

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