Even Integers - Even Positions

PKJ

 Coding Problem Keys 

 Even Integers - Even Positions 

 Problem Statement 

The program must accept N integers as the input. The program must print all the even integers which are at the even positions as the output. If there is no even integer are even positions then the program must print -1 as the output.

 Input Format 

The first line contains the value N.
The second line contains N integers separated by space(s).

 Output Format 

The first line contains the even integers which have occurred at the even positions each separated by space(s).

 Boundary Condition(s) 

1 <= N <= 10⁵
-99999 <= Each Integer Value <= 99999

 Example Input/Output 1 

 Input 

7
43 -49 -22 16 -86 78 77

 Output 

16 78

 Explanation 

The integers present at even positions are -49, 16 and 78. So the even integers are 16 and 78.
Hence the output is 16 and 78.

 Example Input/Output 2 

 Input 

5
24 -45 38 -13 37

 Output 

-1

 Max Execution Time Limit: 2000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n=int(input())
l=list(map(int,input().split()))
k=[]
for i in range(len(l)):
    if(i%2!=0 and l[i]%2==0):
        k.append(l[i])
if len(k)>0:
    print(*k)
else:
    print("-1")

# 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

Cut Down & Plant - Trees

PKJ
 Coding Problem Keys   Cut Down & Plant - Trees   Problem Statement  In a garden, there are N trees from left to right. The height of each tree is passed as input to the program. The gardener wants to cut down T trees completely from left to right, but if he cuts a tree of height H, then he must plant certain number of trees based on the following conditions.     - If H is odd, then he must plant H trees of height ranging from 1 to H on the rightmost end.     - If H is even, then he must plant H/2 trees of height ranging from H/2 to 1 on the rightmost end. The value of T is also passed as the input to the program. The program must print the number of trees remaining in the garden after cutting down T trees as the output.  Boundary Condition(s)  1 <= N <= 100. 1 <= Height of each tree <= 50. 1 <= T <= 1000.  Input Format  The first line contains N. The second line contains N integer values se...
Click to Continue...

Both Adjacent Elements - Odd or Even

PKJ
 Coding Problem Keys   Both Adjacent Elements - Odd or Even   Problem Statement  The program must accept N integers as the input. The program must print the integers that have both the adjacent integer values as odd or even. At least one integer will have both the adjacent values as odd or even among the N integers. (The first and last integers have only one integer adjacent to them. So consider only the single adjacent integer for them).  Boundary Condition(S)  3 <= N <=100 -10 ⁷ <= Each integer value <= 10 ⁷  Input Format  The First line contains the value of N. The Second line contains the N integers separated by space(s).  Output Format  The First line contains the integers (which have both the adjacent element values as odd or even) separated by a space.  Example Input/Output 1   Input  7 10 21 20 33 98 66 29  Output  10 21 20 33 29  Example Input/Output 2   Input...
Click to Continue...

Archery Game

PKJ
 Coding Problem Keys   Archery Game   Problem Statement  In an archery game, a bow and arrow is used to aim at the center of the circular target. The points are awarded based on how close the arrow hits the center of the target. The points for a shoot is calculated by the formula (3 - DISTANCE FROM CENTER OF THE TARGET) * 100 . The target has radius of 3 units and any arrow hitting outside of the target will result in 0 points. Given N records with archer's name and the arrow's landing coordinates print the leaderboard (sorted by the total points, with highest score first) rounded up to 2 decimal places. The archers name could be repeated as a single archer can shoot multiple times.  Boundary Conditions  1 <= N <= 1000.  Input Format  First line contains N. Next N lines contain the archers name and arrow...
Click to Continue...

Shortest Path in Tree

PKJ
 Coding Problem Keys   Shortest Path in Tree   Problem Statement  Given a weighted undirected graph T consisting of nodes valued [0, N-1] and an array Edges[][3] of type {u, v, w} that denotes an edge between vertices u and v having weight w. The task is to find the sum of all pair shortest paths in the given tree.  Input Format  The first line consists of 2 integers denoting N (No. of Nodes) and E (No. of Edges). Next, E lines consists of 3 integers denoting u, v, w.  Output Format  The first line contains the sum of all pair shortest paths in the given tree.  Sample Input/Output 1   Input  3 2 0 2 15 1 0 90  Output  210  Explanation  Sum of weight of the path between nodes 0 and 1 = 90 Sum of weight of the path between nodes 0 and 2 = 15 Sum of weight of the path between nodes 1 and 2 = 105 Hence, sum = 90 + 15 + 105  Sample Input/Output 2   Input  4 3 0 1 1 1 2 2 2 3 3  ...
Click to Continue...

Sum of Digits - Largest Integer

PKJ
 Coding Problem Keys   Sum of Digits - Largest Integer   Problem Statement  The program must accept an integer  N  as the input. The program must print the sum of the digits of the largest integer among the N integers as the output.  Input Format  The first line contains the value of integer N. The second line contains N integers separated by space(s).  Output Format  The first line contains the sum of the digits of the largest integer among N integers.  Boundary Condition(s)  1 <= N <= 100 1 <= Each Integer Value <= 1000  Example Input/Output 1   Input  6 98 74 85 23 58 21   Output  17  Explanation  The largest integer is 98 . So the sum of the digits of 98 is 17 (9 + 8). Hence the output is 17.  Example Input/Output 2   Input  9 401 884 8 203 123 950 475 520 193   Output  14  Max Execution Time Limit: 4000 millisecs   S...
Click to Continue...

K Palindrome Integers

PKJ
 Coding Problem Keys   K Palindrome Integers   Problem Statement  The program accepts two integers  N  and  K  as the input. The program must print the first K palindrome integers greater than N as the output.  Input Format  The first line contains the value of N and K separated by a space.  Output Format  The first line contains K integers representing the first K palindrome integers greater than N.  Boundary Condition(s)  1 <= N <= 10 ⁷ 1 <= K <= 1000  Example Input/Output 1   Input  1221 5   Output  1331 1441 1551 1661 1771   Explanation  Here N = 1221 and K = 5. The first 5 palindrome integers greater than 1221 are 1331, 1441, 1551, 1661 and 1771 . Hence the output is 1331 1441 1551 1661 1771  Example Input/Output 2   Input  658100 10  Output  658856 659956 660066 661166 662266 663366 664466 665566 666666 667766  Max E...
Click to Continue...

Octal Equivalent of N

PKJ
 Coding Problem Keys   Octal Equivalent of N   Problem Statement  Given an integer N as input, the program must print the octal equivalent of N.  Boundary Condition(s)  1 <= N <= 10000000  Input Format  The first line contains the value of N.  Output Format  The first line contains the octal equivalent of N.  Example Input/Output 1   Input  4756  Output  11224  Explanation  The octal equivalent of 4756 is 11224.  Example Input/Output 2   Input  49467  Output  140473  Explanation  The octal equivalent of 49467 is 140473.  Note:  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  print ( oct ( int ( input ()))[ 2 :]) # Published By PKJCODERS  Alter  def decimal_to_octal (decimal): octal = 0 i = 1 while (decimal != 0 ): octal =...
Click to Continue...