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 given conditions

 Example Input/Output 1: 
 Input: 
4 5
50 j 2 41 7
p 47 o 30 e
k 41 3 42 r
75 c d 79 s

 Output: 
417
pkjcoders

Explanation:
The sum of the integers in the given matrix is 417(50 + 2 + 41 + 7 + 47 + 30 + 41 + 3 + 42 + 75 + 79).
The string formed using the characters in the given matrix is pkjcoders.

Example Input/Output 2:
Input:
7 6
31 59 76 66 88 37
1 31 28 83 e 12
27 m u 84 72 8
56 86 63 t 76 55
C 62 25 40 83 r
45 p 1 26 10 70
o 50 31 1 45 88

Output:
1616
Computer

Example Input/Output 3:
Input:
3 3
a b c
d e f
# G H

Output:
0
ad#beGcfH

 Note: Max Execution Time Limit: 50 millisecs 

 Solution: 

 Programming Language: Python 3 Language 

a,c=list(map(int,input().split()))
b=[]
for i in range(0,a):
    b.append(input().split())
d=0
e=""
for i in range(0,c):
    for j in range(0,a):
        if b[j][i].isdigit():
            d+=int(b[j][i])
        else:
            e+=b[j][i]
print(d,"\n",e)

Alter:

r,c=map(int,input().split())
matrix=[list(input().split()) for _ in range(r)]
tot,reqStr=0,''
for i in matrix:
    for j in i:
        if j.isdigit():tot+=int(j)
for col in range(c):
    for row in range(r):
        if matrix[row][col].isdigit()==False:
            reqStr+=matrix[row][col]
print(tot,reqStr,sep="\n")

 Programming Language: C Language 

#include<stdio.h>
#include<stdlib.h>
int main() {
    int R, C, i = 0, j, ans = 0, c = 0; scanf("%d%d\n", &R, &C);
    char mat[R][C][4], s[R * C];
    while(~scanf("%s", mat[i / C][i % C]))
        if(isdigit(*mat[i / C][i++ % C]))
            ans += atoi(mat[--i / C][i++ % C]);
    for(j = 0; j < C; j++)
        for(i = 0; i < R; i++)
            if(!isdigit(*mat[i][j]))
                s[c++] = *mat[i][j];
    s[c] = '\0';
    printf("%d\n%s", ans, s);
}

Alter:

#include<stdio.h>
#include<stdlib.h>
int main(){
    int r,c,sum=0;
    scanf("%d %d",&r,&c);
    char s[r][c][100];
    for(int i=0;i<r;i++){
        for(int j=0;j<c;j++){
            scanf("%s ",&s[i][j]);
            if(atoi(s[i][j]))
               sum+=atoi(s[i][j]);
        }
    }
    printf("%d\n",sum);
    for(int j=0;j<c;j++){
        for(int i=0;i<r;i++){
            if(!atoi(s[i][j])){
                printf("%s",s[i][j]);
            }
        }
    }
}

 Programming Language: C++ Language 

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv){
int r,c;
cin>>r>>c;
int sum =0;
vector<string> sAns(c,"");
for(int i=0;i<r;i++){
    for(int j=0;j<c;j++){
        string temp;
        cin>>temp;
        try{
            int ans = stoi(temp);
            sum+=ans;
        }catch(...){
            sAns[j]+=temp;
        }
    }
}
cout<<sum<<'\n';
for(string i:sAns){
    cout<<i;
}
}

 Programming Language: JAVA Language 

import java.util.*;
public class Hello {
    public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int r=s.nextInt();
		int c=s.nextInt();
		String[][] mat=new String[r][c];
		for(int i=0;i<r;i++) {
		    for(int j=0;j<c;j++) {
		        mat[i][j]=s.next();
		    }
		}
		String str="";
		int a=0;
		for(int j=0;j<c;j++){
		    for(int i=0;i<r;i++){
		        if(Character.isDigit(mat[i][j].charAt(0)))
	                a+=Integer.parseInt(mat[i][j]);
                else
                    str+=mat[i][j];
		    }
		}
		System.out.println(a);
		System.out.print(str);
	}
}

 (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

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 ()) ...
Click to Continue...

Move Hundreds to End

PKJ
 Coding Problem Keys   Move Hundreds to End   Problem Statement  Fill in the missing lines of code to implement the method  (function) moveHundreds (int array[], int size) so that the method moves all the integer values with 100 to the end of the array. The order of the remaining integers must be maintained.  Boundary Condition(s)  1 <= N <= 1000  Example Input/Output 1   Input  6 12 100 45 8 100 25   Output  12 45 8 25 100 100   Explanation  There are two integer values as 100 which are moved to the end. The remaining integers 12 45 8 25 are printed in the same order as given in the input.  Example Input/Output 2   Input  8 100 100 65 100 14 100 100 56   Output  65 14 56 100 100 100 100 100  Max Execution Time Limit: 4000 millisecs   Solution   Programming Language: C Language  void moveHundreds ( int array[], int size){ int ar...
Click to Continue...

Unique Characters

PKJ
 Unique Characters   Problem Statement:  The program must accept a string  S  as the input. The program must find the unique characters present in the string (remove duplicates) and print them in the order of their occurrence in the string S. Note: At least one unique character will be present in the string S. Boundary Condition(s): 1 <= Length of S <= 100 Input Format: The first line contains the string S. Output Format: The first line contains the unique characters in S (in the order of their occurrence in S).  Example Input/Output 1:   Input:  Ethernet112  Output:  Ehrn2 Explanation: The unique characters in the string "Ethernet112" are E, h, r, n and 2. So they are printed in the order of their occurrence in the string "Ethernet112". Hence the output is Ehrn2. Example Input/Output 2: Input: lollipop Output: i  Note: Max Execution Time Limit: 2000 millisecs   Solution:   Programming Language: C...
Click to Continue...

Function printArrayElementsInReverse

PKJ
 Problem Coding Keys   Function  printArrayElementsInReverse    Problem Statement  You must implement the function printArrayElementsInReverse which accepts an integer array arr and it's size as the input. The function must print all the integers of the array in reverse order as the output.  Example Input/Output 1   Input  5 12 45 78 65 32  Output  32 65 78 45 12  Explanation  All five integers are printed in reverse order.  Example Input/Output 2   Input  4 10 80 20 60  Output  60 20 80 10  Note:  Max Execution Time Limit: 4000 millisecs   Solution:   Programming Language: C Language  #include <stdio.h> #include <stdlib.h> void printArrayElementsInReverse ( int arr[], int N){ while (N> 0 ){ printf( "%d " ,arr[--N]); } } //Published By PKJCODERS int main (){ int N; scanf( "%d" , & N); int ...
Click to Continue...

Sort Number By Unit and Tenth Digits

PKJ
 Coding  Problem  Keys   Sort Number By Unit and Tenth Digits    Problem Statement  Given N positive integers, the program must sort the numbers based on their unit digits (Smaller to larger). If the unit digits are same, then consider tenth digit to sorts. Assume no two numbers will have both unit and tenth digits equal.  Input Format  The first line contains N. The second line contains N integers separated by a space.  Output Format  The first line contains the sorted integers separated by a space.  Boundary Conditions  1 <= N <= 100  Example Input/Output 1   Input  9 12 223 10 4345 189 9 455 61 82  Output  10 61 12 82 223 4345 455 9 189  Note:  Max Execution Time Limit: 5000 millisecs   Solution:   Programming Language: Python 3 Language  n= int ( input ()) l= input ().split() k= sorted ([i[::- 1 ] for i in l]) print (*[i[::- 1 ] for i ...
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...