C++ Program /** * Problem 1: Simple Selection * * You have a red lottery ticket showing ints a, b, * and c, each of which is 0, 1, or 2. If they * are all the value 2, the payout is 10. * Otherwise if they are all the same, the * payout is 5. Otherwise so long as both b and * c are different from a, the payout is 1. * Otherwise the payout is 0. * * Examples * redTicket(2, 2, 2) → 10 * redTicket(2, 2, 1) → 0 * redTicket(0, 0, 0) → 5 */ int redTicket(int a, int b, int c) { int payout = 0; // ---- YOUR CODE GOES ONLY BELOW THIS LINE // Add your code here return payout; } /** * Problem 2: Intermediate Selection/Logic * * You have been dealt two cards, a and b. * Each card has a value 0-100. Set the variable * nearest to whichever value is nearest to 21 * without going over. Return 0 if both cards go over. * * Examples: * nearest(19, 21) → 21 * nearest(21, 19) → 21 * nearest(19, 22) → 19 */ int nearest(int a, int b) { int nearest = 0; // ---- YOUR CODE GOES ONLY BELOW THIS LINE // Add your code here return nearest; }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

C++ Program

/**
* Problem 1: Simple Selection
*

* You have a red lottery ticket showing ints a, b,
* and c, each of which is 0, 1, or 2. If they
* are all the value 2, the payout is 10.
* Otherwise if they are all the same, the
* payout is 5. Otherwise so long as both b and
* c are different from a, the payout is 1.
* Otherwise the payout is 0.
*
* Examples
* redTicket(2, 2, 2) → 10
* redTicket(2, 2, 1) → 0
* redTicket(0, 0, 0) → 5
*/
int redTicket(int a, int b, int c)
{
int payout = 0;

// ---- YOUR CODE GOES ONLY BELOW THIS LINE
// Add your code here

return payout;
}


/**
* Problem 2: Intermediate Selection/Logic
*
* You have been dealt two cards, a and b.
* Each card has a value 0-100. Set the variable
* nearest to whichever value is nearest to 21
* without going over. Return 0 if both cards go over.
*
* Examples:
* nearest(19, 21) → 21
* nearest(21, 19) → 21
* nearest(19, 22) → 19
*/
int nearest(int a, int b)
{
int nearest = 0;

// ---- YOUR CODE GOES ONLY BELOW THIS LINE
// Add your code here

return nearest;
}

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 9 images

Blurred answer
Knowledge Booster
Types of Function
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.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education