dmoj.ca/problem/ccc99s1 M::OJ PROBLEMS SUBMISSIONS USERS CONTESTS ABOUT CCC '99 S1 - Card Game Write a program that will keep score for a simple two-player game, played with a deck of cards. There are 52 cards in the deck; four of each of 13 possible names: two, three. four five, six, seven, eight, nine, ten, jack, queen, king, ace The cards labelled jack, queen, king, and ace are collectively known as high cards. The deck is shuffled and placed face-down on the table. Player A turns over the top card and places it on a pile; then player B turns over the top card and places it on the pile. A and B alternate until the deck is exhausted. The game is scored as follows: • If a player turns over an ace, with at least 4 cards remaining to be turned over, and none of the next 4 cards is a high card, that player scores 4 points • If a player turns over a • If a player turns over a • If a player turns over a king, with at least 3 cards remaining to be turned over, and none of the next 3 cards is a high card, that player scores 3 points queen, with at least 2 cards remaining to be turned over, and none of the next 2 cards is a high card, that player scores 2 points jack, with at least 1 card remaining to be turned over, and the next card is not a high card, that player scores 1 point Input Specification The input will contain 52 lines. Each line will and so on. Output Specification Whenever a player scores, print Player X scores n point (s). where X is the name of the player (A or 8 ) and n is the number of points scored ( 1, 2, 3, or 4). At the end of the game, print the total score for each player, on two lines: Player A: n point (s). Player 8: m point (s). e name of a card in the deck, in lowercase letters. The first line denotes the first card to be turned over, the next line the next card: Sample Input Copy
dmoj.ca/problem/ccc99s1 M::OJ PROBLEMS SUBMISSIONS USERS CONTESTS ABOUT CCC '99 S1 - Card Game Write a program that will keep score for a simple two-player game, played with a deck of cards. There are 52 cards in the deck; four of each of 13 possible names: two, three. four five, six, seven, eight, nine, ten, jack, queen, king, ace The cards labelled jack, queen, king, and ace are collectively known as high cards. The deck is shuffled and placed face-down on the table. Player A turns over the top card and places it on a pile; then player B turns over the top card and places it on the pile. A and B alternate until the deck is exhausted. The game is scored as follows: • If a player turns over an ace, with at least 4 cards remaining to be turned over, and none of the next 4 cards is a high card, that player scores 4 points • If a player turns over a • If a player turns over a • If a player turns over a king, with at least 3 cards remaining to be turned over, and none of the next 3 cards is a high card, that player scores 3 points queen, with at least 2 cards remaining to be turned over, and none of the next 2 cards is a high card, that player scores 2 points jack, with at least 1 card remaining to be turned over, and the next card is not a high card, that player scores 1 point Input Specification The input will contain 52 lines. Each line will and so on. Output Specification Whenever a player scores, print Player X scores n point (s). where X is the name of the player (A or 8 ) and n is the number of points scored ( 1, 2, 3, or 4). At the end of the game, print the total score for each player, on two lines: Player A: n point (s). Player 8: m point (s). e name of a card in the deck, in lowercase letters. The first line denotes the first card to be turned over, the next line the next card: Sample Input Copy
Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter7: File Handling And Applications
Section: Chapter Questions
Problem 7PE
Related questions
Question
Write in python please
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,