Same Unit Digit Adjacent Numbers

PKJ

 Coding Problem Keys 

 Same Unit Digit Adjacent Numbers 

 Problem Statement 

A matrix of size R*C (R rows and C columns) containing numbers (positive integer values) is passed as input. The program must print the count C of numbers in a given cell which has at least one adjacent cell (in the same row) containing a number with the same unit digit.

 Input Format 

The first line contains R and C separated by a space.
Next R lines contains C values separated by a space.

 Output Format 

The first line contains C.

 Boundary Conditions 

1 <= R, C <= 100.

 Example Input/Output 1 

 Input 

4 3
20 27 67
13 74 100
37 90 97
53 75 44

 Output 

2

 Explanation 

The numbers are 27 67 in the first row where both have 7 as their unit digit.

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: C Language 

#include<stdio.h>
#include <stdlib.h>
int main(){
    int r,c,i,j,count=0;
    scanf("%d%d",&r,&c);
    int a[r][c];
    for(i=0;i<r;i++){
        for(j=0;j<c;j++){
            scanf("%d",&a[i][j]);
        }
    }
    for(i=0;i<r;i++){
        for(j=0;j<c;j++){
            if(j==0){
                if(a[i][j]%10==a[i][j+1]%10){
                    count++;
                }
            }else if(j==c-1){
                if(a[i][j]%10==a[i][j-1]%10){
                    count++;
                }
            }else{
                if(a[i][j]%10==a[i][j-1]%10||a[i][j]%10==a[i][j+1]%10){
                    count++;
                }
            }
        }
    }
    printf("%d",count);
}
//Published By PKJCODERS

 Programming Language: C++ Language 

#include <iostream>
using namespace std;
int main()
{
 int i,j,r,c,cn=0;
 cin>>r>>c;
 int a[r][c];
 for(i=0;i<r;i++)
  for(j=0;j<c;j++)
   cin>>a[i][j];
  for(i=0;i<r;i++){
      for(j=1;j<c-1;j++)
       if(a[i][j]%10==a[i][j+1]%10||a[i][j]%10==a[i][j-1]%10)
        cn++;
      if(a[i][0]%10==a[i][1]%10) cn++;
      if(a[i][c-1]%10==a[i][c-2]%10) cn++;
  }
 cout<<cn;
}
//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

Largest of Tenth Digit and Unit Digit

PKJ
 Coding Problem Keys   Largest of Tenth Digit and Unit Digit   Problem Statement  Given an integer N as input, the program must print the largest of the tenth digit and the unit digit in the integer N.  Boundary Condition(s)  10 <= N <= 9999999  Input Format  The first line contains the value of N.  Output Format  The first line contains the largest of the tenth digit and the unit digit in the integer N.  Example Input/Output 1   Input  5442  Output  4  Explanation  Tenth digit (4) is greater than unit digit (2).  Example Input/Output 2   Input  4567  Output  7  Explanation  Unit digit (7) is greater than tenth digit (6).  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= input () if (n[- 1 ]>n[- 2 ]): print (n[- 1 ]) else : print (n[- 2 ]) # Published By PKJC...
Click to Continue...

Jooney's Amusement Park

PKJ
 Coding Problem Keys   Jooney's Amusement Park   Problem Statement  In the amusement park at Jooney's amusement, there is a "Weighted Maze" challenge. This consist of a set of East West roads and North South roads (referred to as up down roads). There are N intersections and each intersection has a block of iron bar, the weight of which is given. You enter the maze at the top left corner. The exit from the maze is at the bottom right corner. Movement at any intersection is to the right or down provided a road exists in that direction. At each Intersection you pass through, you must exchange the weight in your cart with the weight of the bar at the intersection if it is heavier than the weight in you have in the cart. The objective is to determine a path through the maze along the roads so that one can exit the maze with minimum weight in the cart.  Input Format  The first line contains the number of intersections N.  Output Format  The f...
Click to Continue...

Christmas Tree Pattern

PKJ
 Coding Problem Keys   Christmas Tree Pattern   Problem Statement  John is a pure Desi boy. And his one and only dream is to meet Santa Claus. He decided to decorate a Christmas tree for Santa on coming Christmas. John made an interesting Christmas tree that grows day by day. The Christmas tree is comprised of the following:     - Parts     - Stand Each Part is further comprised of Branches. Branches are comprised of Leaves. How the tree appears as a function of days should be understood. Basis that print the tree as it appears on the given day. Below are the rules that govern how the tree appears on a given day. Write a program to generate such a Christmas tree whose input is the number of days. Rules 1) If the tree is one day old, you cannot grow. Print the message "You cannot generate christmas tree" 2) Tree will die after 20 days. It should give a message "Tree is no more". 3) Tree will have one part less than the number of days. ...
Click to Continue...

First N Repeated Characters

PKJ
 Coding Problem Keys   First N Repeated Characters   Problem Statement  The program must accept a string S and then print all the characters which are among the first N repeated characters in S.  Input Format  The first line contains the value of S. The second line contains the value of N.  Output Format  The first line contains the string output.  Constraints  1 <= Length of S  <= 1000 1 <= N <= 100  Example Input/Output 1   Input  abcdeabecdacdbe 4   Output  abceabecacbe   Explanation  Though all characters a, b, c, d, e are repeated thrice, the first four repeated characters are a b c e.  Example Input/Output 2   Input  officialwork 2   Output  ffii  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  def firstRepeatedChar (s,n): h = {} k=[] for ch ...
Click to Continue...

Function lengthOfLastWord - CTS Pattern

PKJ
 Coding Problem Keys   CTS Pattern   Function lengthOfLastWord   Problem Statement  You are required to fix all the logical errors in the given code. 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 lengthOfLastWord (char *str, int len) accepts a string and length len as the input. The function return the count of last word in a given string. The function compiles successfully but fails to print the desired result due to logical errors. Your task is to debug the program to pass all the test cases.  Max Execution Time Limit: 5000 millise...
Click to Continue...

Print Grandson's Name

PKJ
 Coding Problem Keys   Print Grandson's Name   Problem Statement  The program must accept the first and last names of three persons who are in a family tree and print the grandson's name. Note: The last name of a person is nothing but the father's first name.  Boundary Condition(s)  Length of first and last names are from 3 to 100.  Input Format  The first line contains the first and last name of person 1 separated by a space. The second line contains the first and last name of person 2 separated by a space. The third line contains the first and last name of person 3 separated by a space.  Output Format  The first line contains the first and last name of the grandson separated by a space.  Example Input/Output 1   Input  Arun Kumar Swamy Nathan Kumar Swamy  Output  Arun Kumar  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Languag...
Click to Continue...