Maximum LCM of Adjacent Pair

PKJ

 Coding Problem Keys 

 Maximum LCM of Adjacent Pair 

 Problem Statement 

An array of N integers is passed as the input to the program. The program must print the maximum LCM value of two adjacent integers (among the N integers).

 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 two integers separated by space.

 Boundary Condition(s) 

1 <= N <= 100000

 Example Input/Output 1 

 Input 

4
24 12 50 10

 Output 

300

 Example Input/Output 2 

 Input 

6
15 25 35 70 100 70

 Output 

700

 Max Execution Time Limit: 3000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

def gcd(a,b):
    if a==0:
        return b
    return gcd(b%a,a)
def lcm(a,b):
    return (a//gcd(a,b))*b
n=int(input())
l=list(map(int,input().split()))
k=[]
for i in range(n-1):
    d=lcm(l[i],l[i+1])
    k.append(d)
print(max(k))

# 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

Musical Bench

PKJ
 Coding Problem Keys   Musical Bench   Problem Statement  A group of P players are playing musical bench game in which B number of benches are present in a circular fashion and are placed with equal gaps between adjacent benches. Before the game starts, each one of the players are sitting on any one of these benches which is their initial position IP and each player is having his/her unique id ID. Music is played M number of times (M denotes the number of Round(s) with the duration of play varying which is denoted by M(i). Each player takes his/her own time T(i) to move from one bench to another. If the music is played, players keep moving form one bench to another. At the end of the round one of the benches is removed from the game and also the players who are sitting on that bench are eliminated from the game. The program must print the players ID whose are remaining in the game along with thei...
Click to Continue...

Largest Possible Difference

PKJ
 Coding Problem Keys   Largest Possible Difference   Problem Statement  There are N positive integers passed as the input. The program must print the largest possible differences between N/2 pairs in the descending order as the output.  Boundary Condition(S)  2 <= N <= 50 1 <= Each integer value <= 1000  Input Format  The first line contains N . The second line contains N integers separated by a space.  Output Format  The first line contains the largest possible difference between N/2 pairs in the descending order.  Example Input/Output 1   Input  5 100 50 12 60 55  Output  88 10  Explanation  The largest difference is possible for 100-12. Now the remaining values are 50 60 55. Now the largest possible difference is 60-50.  Example Input/Output 2   Input  6 10 20 30 40 50 60  Output  50 30 10  Example Input/Output 3   Input  3 ...
Click to Continue...

Minimum Alteration String

PKJ
 Coding Problem Keys   Minimum Alteration String   Problem Statement  Given a set of N words, starting word and ending word, the words can be changed to obtain any one of the words in the given list of words by altering exactly one character and the target is to obtain the ending word with the minimum number of alterations starting with the starting word. Print the minimum number of alterations made to obtain the ending word.  Boundary Condition(s)  1 <= N <= 100 2 <= Length of words <= 100  Input Format  The first line contains N. The next N lines contain the list of words. The (N + 2)th line contains starting word The (N + 3)th line contains ending word  Output Format  The first line contains the minimum number of alterations made to obtain the ending word.  Example Input/Output 1   Input  4 pep pap pat pan pen pat  Output  2  Explanation  To change pen to pat. 4 alterations...
Click to Continue...

Frequency Sort

PKJ
 Coding Problem Keys   Frequency Sort - Numbers   Problem Statement  Given N integers, sort them based on their frequency in descending order. If the frequency is same then sort based on their values in ascending order.  Boundary Condition(s)  1 <= N <= 10000.  Input Format  The first line contains N. The second line contains N integers separated by space.  Output Format  The first line contains N integers sorted by their frequency in descending order and their values in ascending order separated by space.  Example Input/Output 1   Input  8 2 1 2 8 7 3 7 2  Output  2 2 2 7 7 1 3 8  Example Input/Output 2   Input  5  5 4 3 2 1  Output  1 2 3 4 5 ...
Click to Continue...

Hamming Distance - Two Integers

PKJ
 Coding Problem Keys   Hamming Distance - Two Integers   Problem Statement  The program must accept two integer values A and B. Then the program must print the Hamming Distance between them. Note: The Hamming Distance between two integers is the number of positions at which the bits are different.  Boundary Conditions  1 <= A, B <= 10 ⁸  Input Format  The first line contains A and B separated by a space.  Output Format  The first line contains an integer representing the Hamming Distance between A and B.  Example Input/Output 1   Input  12 4  Output  1  Explanation  The binary representation of 12 is 1100. The binary representation of 4 is 0100. The bits are different only in the first position.  Example Input/Output 2   Input  10 5  Output  4  Note:  Max Execution Time Limit: 50 millisecs   Solution   Programming Language:...
Click to Continue...

Find the Number

PKJ
 Coding Problem Keys   Find the Number   Problem Statement  You are given a string S of length N. The string S consists of digits from 1-9. Consider the string indexing to be 1-based. You need to divide the string into blocks such that the i-th block contains the elements from the index((i - 1)* X + 1) to min (N, (i * X)) (both inclusive). A number is valid if it is formed by choosing exactly one digit from each block and placing the digits in the order of their block number.  Example  If the given string is '123456789' and X = 3, the blocks formed are [123], [456], [789]. A few valid numbers are 147, 159, 348, etc. but 124 and 396 are invalid. Among all the valid numbers that can be formed, your task is to determine the Kth number if all the unique valid numbers are sorted in ascending order .  Input Format  First line: Three space-separated integers N, X, and K. Second line: String S consisting of digits (1-9).  Output Format...
Click to Continue...