Chef and Card Game | CRDGAME | CodeChef


Chef is playing a card game with his friend Morty Smith.
The rules of the game are as follows:
  • There are two piles of cards, pile A and pile B, each with N cards in it. Pile A belongs to Chef and pile B belongs to Morty.
  • Each card has one positive integer on it
  • The ‘power’ of a card is defined as the sum of digits of the integer on that card
  • The game consists of N rounds
  • In each round, both players simultaneously draw one card each from the top of their piles and the player who draws the card with higher power wins this round and gets a point. If the powers of both players' cards are equal then they get 1 point each.
  • The winner of the game is the player who has more points at the end of N rounds. If both players have equal number of points then the game ends in a draw.
The game is now over and Chef has told Morty to find the winner. Unfortunately, this task is too complex for him. Help Morty find the winner.

Input:

  • First-line will contain T, number of test cases.
  • The first line of each test case will contain N, the number of rounds played.
  • The ith of the next N lines of each test case will contain Ai and Bi, the number on the card drawn by Chef and Morty respectively in round i.

Output:

For each test case, output two space-separated integers on a new line:
Output
  • 0 if Chef wins,
  • 1 if Morty wins,
  • 2 if it is a draw,
    followed by the number of points the winner had.
    (If it is a draw then output either player’s points).

Constraints

  • 1≤T≤1000
  • 1≤N≤100
  • 1≤Ai, Bi≤109

Subtasks

  • 100 points: No additional constraints

Sample Input:

2
3
10 4
8 12
7 6
2
5 10
3 4

Sample Output:

0 2
2 1

Explanation:

Test Case 1:
Round 1:
Chef’s card has power 1+0 = 1,
Morty’s card has power 4.
Therefore, Morty wins the round.
Round 2:
Chef’s card has power 8,
Morty’s card has power 1+2 = 3.
Therefore, Chef wins the round.
Round 3:
Chef’s card has power 7,
Morty’s card has power 6.
Therefore, Chef wins the round.
Therefore, Chef wins the game with 2 points (Morty has 1 point).
Test Case 2:
Round 1:
Chef’s card has power 5,
Morty’s card has power 1+0=1.
Therefore, Chef wins the round.
Round 2:
Chef’s card has power 3,
Morty’s card has power 4.
Therefore, Morty wins the round.
Therefore, the game ends in a draw and both players have 1 point each.

Solution (C++ 14)


#include <bits/stdc++.h>
using namespace std;

int main() {
// your code goes here
int t;
cin>>t;
while(t--)
{
    int num;
    cin>>num;
    int chef_count=0, Morty_count=0;
    int A,B;
    while(num--)
    {
            int count_A=0,count_B=0;
        cin>>A>>B;
        while(A!=0)
        {
            count_A+=A%10;
            A=A/10;
        }
        while(B!=0)
        {
            count_B+=B%10;
            B=B/10;
        }
        if(count_A>count_B)
        chef_count++;
        
        else if(count_A<count_B)
        Morty_count++;
        
        else
        {
            chef_count++;
            Morty_count++;
        }
    }
    if(chef_count>Morty_count)
    cout<<0<<" "<<chef_count<<endl;
    
    else if(chef_count<Morty_count)
    cout<<1<<" "<<Morty_count<<endl;
    
    if(chef_count==Morty_count)
    cout<<2<<" "<<Morty_count<<endl;
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Boxes through a Tunnel | HackerRank

You are transporting some boxes through a tunnel, where each box is a  parallelepiped , and is characterized by its length, width and height. The height of the tunnel   feet and the width can be assumed to be infinite. A box can be carried through the tunnel only if its height is strictly less than the tunnel's height. Find the volume of each box that can be successfully transported to the other end of the tunnel. Note: Boxes cannot be rotated. Input Format The first line contains a single integer  , denoting the number of boxes.  lines follow with three integers on each separated by single spaces    ,   and   which are length, width and height in feet of the  -th box. Constraints Output Format For every box from the input which has a height lesser than   feet, print its volume in a separate line. Sample Input 0 4 5 5 5 1 2 40 10 5 41 7 2 42 Sample ...
Read more

Array Manipulation | HackerRank

Image
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in your array. For example, the length of your array of zeros  . Your list of queries is as follows: a b k 1 5 3 4 8 7 6 9 1 Add the values of   between the indices   and   inclusive: index -> 1 2 3 4 5 6 7 8 9 10 [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 3 , 3 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 7 , 7 , 7 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 8 , 8 , 8 , 1 , 0 ] The largest value is   after all operations are performed. Function Description Complete the function  arrayManipulation  in the editor below. It must return an integer, the maximum value in the resulting array. arrayManipulation has the fo...
Read more

String Validators | HackerRank

Python has built-in string validation methods for basic data. It can check if a string is composed of alphabetical characters, alphanumeric characters, digits, etc. str.isalnum() This method checks if all the characters of a string are alphanumeric  (a-z, A-Z and 0-9) . >>> print 'ab123'.isalnum() True >>> print 'ab123#'.isalnum() False str.isalpha() This method checks if all the characters of a string are alphabetical  (a-z and A-Z) . >>> print 'abcD'.isalpha() True >>> print 'abcd1'.isalpha() False str.isdigit() This method checks if all the characters of a string are digits  (0-9) . >>> print '1234'.isdigit() True >>> print '123edsd'.isdigit() False str.islower() This method checks if all the characters of a string are lowercase characters  (a-z) . >>> print 'abcd123#'.islower() True >>> print 'Abcd123#'.islower() False str....
Read more