Matrix Columns - Largest Integer

PKJ

 Coding Problem Keys 

 Matrix Columns - Largest Integer 

 Problem Statement 

The program must accept a matrix of size R*C containing distinct values and print the columns which are having a value which is the largest in a given row.

 Boundary Condition(S) 

2 <= R, C <= 50
1 <= Matrix element value <= 10⁵

 Input Format 

The first line contains R and C separated by a space.
The next R lines, each contains C integers separated by a space.

 Output Format 

The first R lines contain the integer values based on the given conditions.

 Example Input/Output 1 

 Input 

4 5
60 100 59 46 70
90 64 11 91 88
86 51 7 37 89
23 34 32 20 2

 Output 

100 46 70
64 91 88
51 37 89
34 20 2

 Explanation 

Max value in Row 1 is 100 which is in column 2.
Max value in Row 2 is 91 which is in column 4.
Max value in Row 3 is 89 which is in column 5.
Max value in Row 4 is 34 which is in column 2.
Hence the columns 2, 4 and 5 are printed.

 Example Input/Output 2 

 Input 

5 8
73 68 16 10 80 44 22 89
81 84 15 64 99 75 46 56
87 11 40 24 97 58 17 71
48 37 26 65 50 18 59 25
19 57 36 83 13 92 31 39

 Output 

10 80 44 89
64 99 75 56
24 97 58 71
65 50 18 25
83 13 92 39

 Note: Max Execution Time Limit: 50 millisecs 

 Solution 

 Programming Language: Python 3 Language 

r,c=map(int,input().split())
l=[list(map(int,input().split())) for i in range(r)]
s=[]
for i in range(r):
    for j in range(c):
        if(l[i][j]==max(l[i])):
            s.append(j)
for i in range(r):
    for j in range(c):
        if j in s:
            print(l[i][j],end=" ")
    print()

# 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

Vaccine Distribution

PKJ
 Coding Problem Keys   Vaccine Distribution    Problem Statement  There is a large manufacturer of vaccine which produces M types of vaccines (whose formulas are derived from different pharma brands). The manufacturer needs to divide all the vaccines between N dealers. It is acceptable if some dealers do not get any vaccine. However, no dealer wants vaccine of different kinds which means that all vaccines that a dealer gets need to be of the same type. The manufacturer also knows that dealers will be jealous if a dealer gets too many vaccines. As an approximation, the jealousy level among the dealers is defined as the largest number of vaccines given to any dealer.  Task  Help the manufacturer to divide all the vaccines among the dealers such that the jealousy level is minimized.  Example  Assumptions N = 5 M = 2 arr = [7, 4]  Approach  There are 7 vaccines of 1st type and 4 vaccines of 2nd type. Let the two types be defined by...
Click to Continue...

String Rotation Odd and Even Positions

PKJ
 Coding Problem Keys   String Rotation Odd and Even Positions   Problem Statement  A string S and two integers M and N are passed as input. The program must rotate the characters present in the odd positions of the string M times and rotate characters present in the even positions of the string N times.  Boundary Condition(s)  2 <= Length of the string <= 1000. 1 <= M, N <= 1000.  Input Format  The first line contains the values of S, M and N separated by space(s).  Output Format  The first line contains the rotated string.  Example Input/Output 1   Input  technology 2 3  Output  logotycenh  Explanation  The characters present in the odd positions are 'tcnlg'. When rotated 2 positions, the value is 'lgtcn'. The characters present in the even position are 'ehooy', When rotated 3 positions, the value is 'ooyeh'. Hence the rotated string value is 'logotycenh'.  Example Input...
Click to Continue...

Largest Integer

PKJ
 Coding Problem Keys   Largest Integer    Problem Statement  An array of N integers is read from a file. The file name is stored in the variable fileName. Fill in the missing lines of code to print the largest of N integers.  Boundary Condition(s)  1 <= N <= 1000  Input File Format  The first line contains N. The second line contains N integers separated by space(s).  Output File Format The first line contains an integer.  Example Input/Output 1   Input  5 21 56 23 89 64  Output  89  Example Input/Output 2   Input  6 102 456 28 10 23 666  Output  666  Note:  Max Execution Time Limit: 5000 millisecs  ...
Click to Continue...

Desktop Products

PKJ
 Coding Problem Keys   Desktop Products   Problem Statement  A company DigiComparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Each product manufactured by the company has a unique productID from a-z and and A-Z. The laptop products have productIDs (a, i, e, o, u, A, I, E, O, U) while the rest of the productIDs are assigned to the desktop products. The company manager wishes to find the sales data for the desktop products. Given a list of productIDs of the sales of the last N products, write an algorithm to help the manager find the productIDs of the desktop products.  Input Format  The first line of the input consists of an integer numOfProducts, representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ... , productID N  represen...
Click to Continue...

Function middle - CTS Pattern

PKJ
 Coding Problem Keys   CTS Pattern   Function middle   Problem Statement  You are required to correct the syntax of the given code without changing its logic. You can click on run anytime to check the compilation/execution status of the program. You can use printf to debug your code. The submitted code should be logically/syntactically correct and pass all test cases. Do not write the main() function as it is not required. Code Approach:  For this question, you will need to correct the given implementation. We do not expect you to modify the approach or incorporate any additional library methods. The function middle (int num) accepts an integer num as the input. If the count of the digits in the integer num is odd then the function returns the middle digit of the integer num. Else the function returns the two digits in the middle of the integer num. Another function findTenPowVal (int N) accepts a positive integer N as the input is available ...
Click to Continue...

Flowchart Logic 047

PKJ
 Coding Problem Keys   Flowchart Logic 047   Problem Statement  Please fill in the lines of code to implement the logic present in the flowchart.  Example Input/Output 1   Input  18 4 10  Output  1 2 11 13 14 16 17  Note: Max Execution Time Limit: 50 millisecs   Solution   Programming Language: Python 3 Language  N,X,Y= map ( int , input ().split()) ctr= 1 while (ctr<=N): if ((ctr<X or ctr>Y) and ctr% 3 != 0 ): print (ctr,end= " " ) ctr+= 1 # Published By PKJCODERS  Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main () { int N,X,Y; scanf( "%d%d%d" ,&N,&X,&Y); int ctr= 1 ; while (ctr<=N){ if ((ctr<X || ctr>Y) && ctr% 3 != 0 ){ printf( "%d " ,ctr); } ctr++; } } // Published By PKJCODERS  ( Note:  Inca...
Click to Continue...

Reversed Sum of Pairs

PKJ
 Coding Problem Keys   Reversed Sum of Pairs    Problem Statement  An array of N integers is passed as input. The program must print the sum of every two consecutive elements in the array from last.  Boundary Condition(s)  1 <= N <= 1000  Input Format  The first line contains N . The second line contains N integers separated by space(s).  Output Format  The first line contains the sum of pairs separated by a space.  Example Input/Output 1   Input  4 10 50 30 60  Output  90 60  Example Input/Output 2   Input  5 25 50 100 250 300  Output  550 150 25  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main () { int n,i; scanf( "%d" ,&n); int arr[n]; for ( int i= 0 ;i<n;i++){ scanf( "%d" ,&arr[...
Click to Continue...