Array Elements - Divisible by D

PKJ

 Coding Problem Keys 

 Array Elements - Divisible by D 

 Problem Statement 

An array of N positive integers are passed as input. D which is a positive integer is also passed as the input. The program must print the elements in the array which are divisible by D.

 Boundary Condition(s) 

2 <= N <= 10000
1 <= D <= 9999

 Input Format 

The first line contains the value of N.
The second line contains the N values, each separated by a space.
The third line contains the value of D.

 Output Format 

The first line contains the elements among the array which are divisible by D, with each value separated by a space.

 Example Input/Output 1 

 Input 

6
10 20 30 40 50 60
4

 Output 

20 40 60

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n=int(input())
l=list(map(int,input().split()))
d=int(input())
print(*[i for i in l if i%d==0])

# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Print Prime Numbers from 2 to N

PKJ
 Coding Problem Keys   Print Prime Numbers from 2 to N   Problem Statement  The program accepts an integers N as the input. The program must print all the prime numbers from 2 to N (inclusive of N) as the output.  Input Format  The first line contains the value of N.  Output Format  The first line contains all the prime numbers from 2 to N.  Boundary Condition(s)  2 <= N <= 999999  Example Input/Output 1   Input  11   Output  2 3 5 7 11  Example Input/Output 2   Input  120  Output  2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113  Max Execution Time Limit: 3000 millisecs   Solution   Programming Language: Python 3 Language  n= int ( input ()) l=[ True for i in range (n+ 1 )] j= 2 while (j*j<=n): if l[j]== True : for i in range (j*j,n+ 1 ,j):l[i]= False j+= 1 ...
Click to Continue...

Count Number of Occurrences of a Character

PKJ
 Count Number of Occurrences of a Character   Problem Statement:  The program must accept a string S and a character CH as the input. The program must print the number of occurrences of CH in the string S as the output.  Boundary Condition(S):  1 <= Length of S <=1000  Input Format:  The first line contains the string S. The second line contains the character CH.  Output Format:  The first line contains the number of occurrences of CH in the string S.  Example Input/Output 1:   Input:  pineapple p  Output:  3  Explanation:  The character p has occurred three times in the string " p inea pp le". So 3 is printed as the output.  Example Input/Output 2:   Input:  Encyclopedia e  Output:  1 Explanation: The character e has occurred only once in the string "Encyclop e dia". So 1 is printed as the output. Example Input/Output 3: Input: KEYBOARD y Output: 0  Note: M...
Click to Continue...

Mixed Matrix - Integers & Characters

PKJ
 Mixed Matrix - Integers & Characters   Problem Statement:  The program must accept a matrix of size R*C containing integers and characters as the input. The program must print the sum of all the integers in the given matrix. Then the program must print a string representing the characters in the given matrix. The string must be formed by traversing the columns of the matrix from left to right, where each column must be traversed from top to bottom. Note: At least one character is always present in the given matrix. Boundary Condition(s): 2 <= R, C <=50 1 <= Values of each integer in the matrix <=1000 Input Format: The first line contains R and C separated by a space. The next R lines, each contains C values (integers and characters) separated by a space. Output Format: The first line contains an integer representing the sum of all the integers in the matrix. The second line contains a string representing all the characters in the matrix based on the...
Click to Continue...

Most Vowels in Row

PKJ
 Most Vowels in Row   Problem Statement:  The program must accept a character matrix of size NxN as the input. The program must print the row which contains most number of vowels in it. If more than one row has same number of most number vowels then print the last occurring row. Boundary Condition(s): 1 <= N <= 50 Input Format: The first line contain N. The next N lines contain N characters each separated by a space. Output Format:  The first line contains  C characters.  Example Input/Output 1:   Input:  5 G w w t e H d E o P Z D H e W Z l H e A H o O D e  Output:  H o O D e Explanation: The last two rows have 3 vowels. So the last occurring row with most number of vowels is the last row. Example Input/Output 2: Input: 4 w y o o g g t t t o e t a q r q Output: t o e t  Note: Max Execution Time Limit: 4000 millisecs  Solution:   Programming Language: C Language  #include <stdio.h> #include ...
Click to Continue...

Highly Profitable Months

PKJ
 Coding Problem Keys   Highly Profitable Months   Problem Statement  The stocks of a company are being surveyed to analyse the net profit of the company over a period of several months. For an analysis parameter k, a group of k consecutive months is said to be highly profitable if the values of the stock prices are strictly increasing for those months. Given the stock prices of the company for n months and the analysis parameter k, find the number of highly profitable months  Example  Let the number of months be n = 8, the stock prices be stockPrices = [5, 3, 5, 7, 8] and the analysis parameter be k = 3. Following are the groups of k months in which the stock prices are strictly increasing: Hence the answer is 2.  Function Description  Complete the function countHighlyProfitableMonths in the editor below. countHighlyProfitableMonths has the following parameters:     int stockPrices[n]: the stock prices for n months.   ...
Click to Continue...

Print Matrix - Diagonal Zig Zag

PKJ
 Coding Problem Keys   Print Matrix - Diagonal Zig Zag   Problem Statement  An R*C matrix is passed as the input to the program. The program must print the values in zig-zag order diagonally. (Please refer Example Input/Output section for more details).  Input Format  The first line contains R and C separated by a space. Next R lines contain C values separated by a space.  Output The first line contains all R*C elements in zig-zag order diagonally, with the elements separated by a space.  Boundary Conditions  2 <= R, C <= 100.  Example Input/Output 1   Input  3 3 1 2 3 4 5 6 7 8 9  Output  1 2 4 7 5 3 6 8 9  Example Input/Output 2   Input  3 7 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 1 2 3  Output  1 2 8 6 9 3 4 1 7 8 2 5 6 3 9 1 4 7 5 2 3  Note:  Max Ex...
Click to Continue...