Zopper Programming Assessment Problem 2 with solution
This is the second problem from HackerEarth that I tried for the friend for interview:
HackerMan says that 5 and 8 are smart digits. A positive integer is called a smart number if it has only smart digits in its decimal representation.
HackerMan has three sets of numbers. And he needs your help to find out the number of distinct smart numbers that he can make using one number from each of the three sets. You have to help in it
Note: You must not count the same smart number more than once.
- The three sets will contain between 1 and 50 elements, inclusive.
- Each number in the three sets will contain numbers between 1 and 30,000, inclusive.
- The first, third and fifth lines will contain a number N that will specify the count of numbers in the sets on the second, fourth and sixth lines of input.
- The second, fourth and sixth line will contain the three sets of numbers respectively.
Print a single line containing the count of distinct smart numbers.
3 5 4
2 1 3
2 1 5
We have two smart numbers 5 = 3 + 1 + 1 and 8 = 5 + 2 + 1. 8 can be also expressed as 4 + 2 + 2, but you must not count 8 twice.
Time Limit: 2 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded if any testcase passes.
if __name__ == "__main__":
n = raw_input()
list1 = raw_input()
list2 = raw_input()
list3 = raw_input()
list1 = [int(n) for n in list1.split(" ")]
list2 = [int(n) for n in list2.split(" ")]
list3 = [int(n) for n in list3.split(" ")]
bigList = 
for n in list1:
for m in list2:
for o in list3:
bigList = list(set(bigList))
smart_number = 0
for n in bigList:
smart_number = smart_number+1 if (n % 10 == 5 or n % 10 == 8) else smart_number