Special Multiple - Hackerrank Problem Solution

Special Multiple

Hackerrank Problem Solution

PROBLEM STATEMENT

You are given an integer N. Can you find the least positive integer X made up of only 9's and 0's, such that, X is a multiple of N?

Update

X is made up of one or more occurences of 9 and zero or more occurences of 0.

Input Format
The first line contains an integer T which denotes the number of test cases. T lines follow.
Each line contains the integer N for which the solution has to be found.

Output Format
Print the answer X to STDOUT corresponding to each test case. The output should not contain any leading zeroes.

Constraints
1 <= T <= 104
1 <= N <= 500

Sample Input

3
5
7
1

Sample Output

90
9009
9

Explanation
90 is the smallest number made up of 9's and 0's divisible by 5. Similarly, you can derive for other cases.

 .

---

SOLUTION

#!/bin/python3 import os import sys # Complete the solve function below. def solve(n): i = 1 while(True): t = int(bin(i)[2:])*9 if(t%n == 0): return str(t) else: i+=1 continue if __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') t = int(input()) for t_itr in range(t): n = int(input()) result = solve(n) fptr.write(result + '\n') fptr.close()

Share Share Tweet Share Share Share

LIKE?

SHARE If you find this useful, please share with your friends and Community.
CODE TOGETHER..GROW TOGETHER.