Matrix Unit Digit Swap

PKJ

 Coding Problem Keys 

 Matrix Unit Digit Swap 

 Problem Statement 

The program must accept an integer matrix of size R*C, where C is even and swap the unit digits of the elements in columns 1 and 2, then 3 and 4 and so on till columns C-1 and C. Then the program must print the revised matrix as the output.

 Input Format 

The first line contains the value of R and C separated by space(s).
The next R lines each containing C integer values separated by a space.

 Output Format 

R lines each containing C integer values separated by a space.

 Constraints 

1 <= R, C <= 100
1 <= Value of an element in the matrix <= 1000

 Example Input/Output 1 

 Input 

3 4
96 61 138 32
150 67 131 177
172 103 83 45

 Output 

91 66 132 38
157 60 137 171
173 102 85 43

 Max Execution Time Limit: 1000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

r,c=map(int,input().split())
l=[list(map(int,input().split())) for i in range(r)]
for i in range(r):
    for j in range(c):
        if(j%2==0):
            l[i][j],l[i][j+1]=(l[i][j]//10*10)+(l[i][j+1]%10),l[i][j+1]//10*10+l[i][j]%10
for i in range(r):
    for j in range(c):
        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

Snakes and Ladders

PKJ
 Coding Problem Keys   Snakes and Ladders   Problem Statement  In an R*C matrix, a snake is represented using the letter 'S' and the ladder is represented using the letter 'L'. A kid is playing the Snakes and Ladders game with this matrix and a die which can show from 1 to 6. The game always starts with the pawn in the lower left most cell in the matrix and the aim is to reach or cross the top left most cell by casting the die as many times as required. Based on the number cast in the die, if the pawn lands up in a cell containing a snake, the pawn must move to the immediate lower row (if it is not in the lowermost row) in the same column. Based on the number cast in the die, if the pawn lands up in a cell containing a ladder, the pawn must move to the immediate upper row in the same column (It may so happen that the pawn is already in the top most row and if it encounters a ladder it is consider...
Click to Continue...

Sort integers in String

PKJ
 Coding Problem Keys   Sort integers in String   Problem Statement  The program must accept a string S which has only numbers and underscores in it as the input. The program must print only the integers present in the string S sorted in ascending order.  Boundary Condition(s)  2 <= Length of the string S <= 100  Input Format  The first line contains the value of string S.  Output Format  The first line contains the list of numbers sorted in ascending order.  Example Input/Output 1   Input  15_17_185_76_3_61   Output  3 15 17 61 76 185  Example Input/Output 2   Input  _5_98_15_17_185_76_3_61_  Output  3 5 15 17 61 76 98 185  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  l=[] for i in input ().split( "_" ): if i.isnumeric(): l.append( int (i)) print (* sorted (l)) # P...
Click to Continue...

Flowchart Logic 065

PKJ
 Coding Problem Keys   Flowchart Logic 065   Problem Statement  Please fill in the lines of code to implement the logic present in the flowchart.  Example Input/Output 1   Input  8 30 9  Output  9 19 20  Example Input/Output 2   Input  16 49 3  Output  23 30 31 32 33 34 35 36 37 38 39 43  Note: Max Execution Time Limit: 50 millisecs   Solution   Programming Language: Python 3 Language  x,y,d= map ( int , input ().split()) while (x<=y): temp=x while (temp> 0 and temp% 10 !=d): temp//= 10 if (temp> 0 and temp% 10 ==d): print (x,end= " " ) x+= 1 # Published By PKJCODERS  Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main (){ int x,y,d,temp= 0 ; scanf( "%d%d%d" ,&x,&y,&d); while (x<=y){ temp=x; while (temp> 0 ...
Click to Continue...

Reverse Column - First and Last

PKJ
 Coding Problem Keys   Reverse Column - First and Last   Problem Statement  The program must accept an integer matrix of size RxC as the input. The program must reverse all the elements in the column if the first and last elements of the column are same. Then the program must print the modified matrix as the output.  Input Format  The first line contains the value of R and C separated by space. The next R lines contain each C elements separated by space(s).  Output Format  The first R lines contain each C elements separated by space.  Boundary Condition(s)  2 <= R, C <= 50 -999 <= Each element of the matrix <= 999  Example Input/Output 1   Input  5 4 11 7 5 19 4 13 16 10 9 9 13 0 7 5 17 8 11 8 5 12   Output  11 7 5 19 7 13 17 10 9 9 13 0 4 5 16 8 11 8 5 12  Explanation  The elements in the first column are 11, 4, 9, 7 and 11. Here the first and the last elements are same. So ...
Click to Continue...

Alphabetical Order Pattern

PKJ
 Coding Problem Keys   Alphabetical Order Pattern   Problem Statement  The program must accept a string S containing only alphabets as the input. The program must print all the alphabets of S in alphabetical order with respect to their positions as shown in the Example Input/Output Section.  Input Format  The first line contains the value of S.  Output Format  The first line contains the desired pattern as shown in the Example Input/Output Section.  Constraints  3 <= Length of S  <= 100  Example Input/Output 1   Input  Tenth   Output  *e*** ****h **n** T**t*  Example Input/Output 2   Input  SkillRack   Output  ******a** *******c* **i****** *k******k ***ll**** *****R*** S********  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  l= input ().strip() k=[x.lower() for x in l] d= 0 ...
Click to Continue...

String With Most Vowels

PKJ
 Coding Problem Keys   String With Most Vowels   Problem Statement  Two Strings S1 and S2 are given as input. The program must print the string with the most number of vowels. If two strings have the same number of vowels, print the string with greater length.  Boundary Condition(s)  1 <= Length of Strings <=1000  Input Format  The first line S1 and S2 separated by space(s).  Output Format  The first line contains a string.  Example Input/Output 1   Input  adder divider  Output  divider  Example Input/Output 2   Input  important welcome  Output  important  Note:  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Java Language  import java.util.* ; public class Hello { public static int vowel (String s){ int x= 0 ; s=s. toLowerCase (); char ch; for ( in...
Click to Continue...