String Comparision

PKJ

  String Comparision 

 Problem Statement: 
The program must accept two string values S1 and S2 as the input. The program must print yes if the both the string values are equal. Else the program must no as the output.
Note: S1 and S2 contain only lowercase alphabets.

 Boundary Condition(S): 
1 <= Length of S1, S2 <=100

 Input Format: 
The first line contains the string S1.
The second line contains the string S2.

 Output Format: 
The first line contains either yes or no.

 Example Input/Output 1: 
 Input: 
eagle
eagle

 Output: 
yes

 Explanation: 
Both the string values (S1 and S2) are equal. So yes is printed as the output.

 Example Input/Output 2: 
 Input: 
tortoise
rabbit

 Output: 
no

 Note: Max Execution Time Limit: 4000 millisecs 

 Solution: 

 Programming Language: C Language 

#include <stdio.h>
#include <stdlib.h>
int main() {
    char a[101],b[101];
    scanf("%s%s",a,b);
    if(strcmp(a,b)){
        printf("no");
    }else{
        printf("yes");
    }
}

 (Note: Just incase the code shows any error kindly comment us with your feedback to help us improvise from our mistake.) 

Comments

Post a Comment

Popular Posts

Property Inheritance in Family

PKJ
 Coding Problem Keys   Property Inheritance in Family   Problem Statement  The hierarchy of a family is given as the input. The first N lines contain the family hierarchy with each line containing the parent and the child names separated by a space. Each person in the family inherits the property only from his parents. (The value of the property of a parent is divided equally among his children). After the family hierarchy information, the names of two family members X and Y are also passed as the input. The value of property V inherited by the family member X is also given as the input. The program must find and print the value of property inherited by the family member Y. Note: If the value of the property of a parent cannot be divided by the number of children without leaving a remainder, then consider the floor value as the amount inherited by a single child. (As an example if the property worth is 10000 and number of children is 3, then the amount inh...
Click to Continue...

Bit Party

PKJ
 Google Competition    Code Jam   Bit Party   Problem Statement  These days, robots can drive cars, but can they throw a good party? We just deployed R robot shoppers to our local supermarket to buy party supplies. The first-order model of a Canadian party was very simple: they just bought B "bits" (a bit being a small donut-like treat found in the area). We will work on improving their AI later, but for now, we want to help them purchase all of those bits as quickly as possible. The supermarket has C cashiers who can scan customers' purchases. The i-th cashier will: accept a maximum of M ᵢ items per customer take S ᵢ  seconds to scan each item spend a further P ᵢ  seconds handling payment and packaging up the bits. That is, a customer who brings N bits to the i-th cashier (where N must be less than or equal to M ᵢ ) will spend a total of S ᵢ  x N + P ᵢ   seconds interacting with that cashier. Before the robots interact wit...
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...

Sort Rows by Prime, Even and Odd Count

PKJ
 Coding Problem Keys   Sort Rows by Prime, Even and Odd Count   Problem Statement  An integer matrix of size R*C is given as input. The program must sort the rows based on the number of prime numbers in descending order. If two rows contain the same number of prime numbers then sort the rows based on the number of even numbers(also non-prime). If two rows contain the same number of prime numbers and the same number of even numbers then sort the rows based on the number of odd numbers (also non-prime). If two rows contain the same number of prime numbers, even numbers and odd numbers then sort the rows based on the sum of elements of each row in descending order.  Boundary Condition(s)  1 <= R, C <= 100  Input Format  The first line contains the value of R and C separated by space(s). Next R lines contains C integers each separated by space(s).  Output Format  R lines containing C integers with the rows sorted based on giv...
Click to Continue...

Integer - Alphabet Pairs to Matrix

PKJ
 Coding Problem Keys   Integer - Alphabet Pairs to Matrix   Problem Statement  The program must accept a list of integer-alphabet pairs and two integers R, C as the input. The sum of the integers present in all the integer-alphabet pairs is always equal to the product of R and C. The program must form a matrix of size R*C based on the following conditions.     - The program must expand each integer-alphabet pair by repeating the specified alphabet X times, where X represents the integer value present in the pair.     - Then the program must fill the matrix with the expanded alphabets from the 1st row to the Rth row, where left to right in each row. Finally, the program must print the R*C matrix as the output.  Boundary Condition(S)  2 <= R, C <= 50  Input Format  The first line contains a list of integer-alphabet pairs separated by a space. The second line contains R and C separated by a space.  Output For...
Click to Continue...

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...