Distinct Length Pairs

Distinct Length Pairs 

Program: 

The program must accept M integers and N integers as the input. The program must form pairs of integers by selecting one integer from M integers and another integer from N integers. Then the program must print the number of pairs containing two integers with different numbers of digits as the output. 

Input: 

3 4 

12 1 454 

988 2 112 47 

Output: 

8 

Program: 

n1,n2 = map(int,input().split())

list1 = list(map(str,input().split()))

list2 = list(map(str,input().split()))

dict1 = dict() 

dict2 = dict()

for i in list1: 

    try: 

        dict1[len(i)] += 1 

    except: 

        dict1[len(i)] = 1 

for i in list2: 

    try: 

        dict2[len(i)] += 1 

    except: 

        dict2[len(i)] = 1 

count = 0 

for i in dict1: 

    for j in dict2: 

        if i!=j: 

            count += (dict1[i]*dict2[j]) 

print(count)            

Explanation: 

1. Accept the number of integers and two lists. 

2. Declare two dictionaries. 

3. Iterate through the first list, find the length of each number. If the length of the number exists in the dictionary, increment the count. If not, declare the length of the number  in the dictionary and assign 1 to it. 

4. Repeat the step 3 for the second list. 

5. Iterate through the dictionaries, if the length is not the same, multiply the count and add the results. 

 

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more