Given a large number (represented as string S)  which has to divided by another number (represented as int data type D). The task is to find division of these numbers.
Example 1:
Input: S = "123456" , D = 36
Output: 3429
Explanation: simply S/D = 3429
Example 2:
Input: S = "91345243" , D = 67
Output: 1363361
Explanation: S/D = 1363361
Your Task:  
You don't need to read input or print anything. Your task is to complete the function longDivision() which accepts a string S and an integer divisor D as input parameter and returns a string.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)
 
Constraints:
1 <= N <= 10^{5 }

Difficulty: EASY
Tags: String algorithms

Data structures
Skill types: Data structures
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Starter code:
#User function Template for python3

class Solution:
    def longDivision(self, S, D):
        # code here

Solutions:
class Solution:

	def longDivision(self, S, D):
		S = int(S)
		divide = S // D
		return divide


class Solution:

	def longDivision(self, s, d):
		t = int(s)
		return t // d


class Solution:

	def longDivision(self, S, D):
		x = int(S)
		y = int(D)
		return x // y


class Solution:

	def longDivision(self, S, D):
		no = int(S)
		return no // D


class Solution:

	def longDivision(self, S, D):
		s = int(S)
		return s // D


class Solution:

	def longDivision(self, S, D):
		a = int(S)
		return str(a // D)


class Solution:

	def longDivision(self, S, D):
		start = 0
		rem = '0'
		ans = ''
		for i in range(len(S) + 1):
			temp = int(rem + S[start:i])
			if temp >= D:
				ans += str(temp // D)
				rem = str(temp % D)
				start = i
				i += 1
			else:
				if ans != '':
					ans += '0'
				i += 1
		if ans == '':
			return '0'
		return ans


class Solution:

	def longDivision(self, S, D):
		n = int(S)
		return n // D


class Solution:

	def longDivision(self, S, D):
		import math
		ans = int(S) // int(D)
		return ans


class Solution:

	def longDivision(self, S, D):
		n1 = int(S)
		n2 = int(D)
		n3 = n1 // n2
		s = str(n3)
		return s


class Solution:

	def longDivision(self, S, D):
		S1 = int(S)
		str1 = ''
		i = S1 // D
		str1 = str(i)
		return str1


class Solution:

	def longDivision(self, S, D):
		s1 = int(S)
		return s1 // D


class Solution:

	def longDivision(self, S, D):
		p = int(S) // D
		return p


class Solution:

	def longDivision(self, S, D):
		return int(S) // int(D)
if __name__ == '__main__':
	t = int(input())
	for _ in range(t):
		s = input().strip()
		d = int(input().strip())
		ob = Solution()
		print(ob.longDivision(s, d))


class Solution:

	def longDivision(self, S, D):
		k = int(S) // D
		return k


class Solution:

	def longDivision(self, S, D):
		a = int(S)
		b = int(D)
		return a // b


class Solution:

	def longDivision(self, S, D):
		num = int(S)
		res = num // D
		return res


class Solution:

	def longDivision(self, S, D):
		t = int(S)
		return t // D


class Solution:

	def longDivision(self, S, D):
		Rem = int(S) % D
		S1 = int(S) - Rem
		return int(S1 // D)


class Solution:

	def longDivision(self, S, D):
		S = int(S)
		R = S // D
		return R


class Solution:

	def longDivision(self, S, D):
		k = 1
		sus = int(S)
		h = sus // D
		return h