Given two integers A and B. Find the smallest number X (greater than A) which is divisible by B.
 
Example 1:
Input:
A = 5
B = 3
Output:
6
Explanation:
6 is the smallest number
greater than 5 which is 
divisible by 3
Example 2:
Input:
A = 25
B = 13
Output:
26
Explanation:
26 is the smallest number
greater than 25 which is
divisible by 13
Your Task:
You don't need to read input or print anything. Your task is to complete the function find() which takes two integers A and B as input parameters and returns a smallest possible integer greater than A which is divisible by B.
 
Expected Time Complexity: O(1)
Expected Space Complexity: O(1)
 
Constraints:
0 <= A,B <= 10^{9}

Source: geeksforgeeks | Difficulty: EASY
Tags: Mathematics

Starter code: #User function Template for python3

class Solution:
    def find(self,A,B): 
        # code here

Solutions:
class Solution:

	def find(self, A, B):
		return (A // B + 1) * B


class Solution:

	def find(self, A, B):
		diff = B - A % B
		return diff + A


class Solution:

	def find(self, A, B):
		x = A % B
		return A + (B - x)


class Solution:

	def find(self, A, B):
		i = A
		while A > 0:
			i = i + 1
			if i % B == 0:
				break
		return i


class Solution:

	def find(self, A, B):
		r = int(A / B)
		r = r + 1
		r = r * B
		return r


class Solution:

	def find(self, A, B):
		k = max(A, B)
		i = 0
		j = A
		while i < k:
			j = j + 1
			if j % B == 0:
				return j
			i = i + 1


class Solution:

	def find(self, A, B):
		if A % B == 0:
			return A + B
		else:
			while A % B != 0:
				A += 1
			return A


class Solution:

	def find(self, A, B):
		for i in range(A + 1, 1000000000):
			if i % B == 0:
				return i


class Solution:

	def find(self, A, B):
		Y = A % B
		return A + B - Y