### Zopper online assesment question on HackerEarth with solution.

Recently a friend asked me to solve a problem which he got on one of the interview, online assessment test. I decided to document my solution here. The companies name was Zopper and the question was asked on the initial online screening test on HackerEarth.

**Problem:****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.

**Constraints**

- 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.

**Input Format**

- 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.

**Output Format**

Print a single line containing the count of distinct smart numbers.

Sample Input

3

3 5 4

3

2 1 3

3

2 1 5

Sample Output

2

Explanation

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.

Allowed languages: C, C++, Clojure, Go, Haskell, C#, Java, JavaScript, Objective-C, Perl, PHP, Python, Ruby

MAX_ROW=500

MAX_COL=500

def assign_walls(row,col):

w = raw_input()

inp = w.split(" ")

if inp[0] is 'C':

col.append(int(inp[1]))

else:

row.append(int(inp[1]))

def main():

sections = []

row = []

col = []

section_areas=[]

row_counter = 0

col_counter = 0

row_section = [(0,MAX_ROW)]

col_section = [(0,MAX_COL)]

no_of_walls = raw_input()

for i in range(int(no_of_walls)):

assign_walls(row,col)

row.sort()

col.sort()

#print row

#print col

for i in row:

if(i < row_section[row_counter][1]):

row_end = row_section[row_counter][1]

row_start = row_section[row_counter][0]

row_section[row_counter] = (row_start,i)

row_section.append((i,row_end))

row_counter = row_counter+1

for i in col:

if(i < col_section[col_counter][1]):

col_end = col_section[col_counter][1]

col_start = col_section[col_counter][0]

col_section[col_counter] = (col_start,i)

col_section.append((i,col_end))

col_counter = col_counter+1

#print row_section

#print col_section

for i in row_section:

row_length = i[1]-i[0]

#print row_length

for j in col_section:

col_length = j[1]-j[0]

#print col_length

area = row_length*col_length

#print area

section_areas.append(area)

return section_areas[len(section_areas)-1]

if __name__ == "__main__":

out = []

t = raw_input()

for i in range(int(t)):

out.append(main())

for x in out:

## Comments

## Post a Comment