Sum of Non-prime Digits - WIPRO

Sum of Non-prime Digits - WIPRO 

Problem:

The program must accept an integer N as the input. The program must print the sum of non-prime digits in N as the output. If there is no such digit, the program must print -1 as the output. 

Input 1: 

219517 

Output 1: 

11   

Input 2: 

3005 

Output 2: 

0 

Input 3: 

725 

Output 3: 

-1

Program:

number = int(input())

total = 0 

non_prime = 0 

while number > 0: 

    rem = number % 10 

    if rem not in [2,3,5,7]: 

        total += rem 

        non_prime = 1 

    number //= 10    

if non_prime:

    print(total)

else:    

    print(-1)        

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

Grouping Colorful LEDs - Accenture

Grouping Colorful LEDs - Accenture Problem: The program must accept the names of the colors in an LED serial set as the input. The program must find the number of groups of LEDs having the same color at the beginning and the end in the given LED serial set. Also consider each LED in the given LED serial set as a group. Finally, the program must print the number of groups of LEDs as the output. Input 1: Red Blue Green Blue Output 1: 5 Input 2: Yellow Red Yellow Green Blue Yellow Green Output 2: 11 Program: color = input().split()  count = 0 for i in range(len(color)):     if color[i] in color[i+1:]:          count  +=  color[i+1:].count(color[i]) print(count + len(color))     Explanation:  1. Accept a list of color names.  2. Iterate through the list and find the count of each color from the position next to the current position. Since to cover all the possible sublists that start and end with the same color. 3. ...
Read more