Write a program that reads an integer between 1972 and 2001 (year of birth). Print the age group that the person belongs to: twenties, thirties, forties. If the integer is 1971 or less, print "You're too old." For 2002 and above, "You're too young." Sample Run 1: Enter the year of birth : 1998 You're in your twenties. Sample Run 2: Enter the year of birth : 1950 You're too old. Sample Run 3: Enter the year of birth : 1972 You're in your fourties. Sample Run 4: Enter the year of birth : 2017 You're too young.

Write a program that reads an integer between 1972 and 2001 (year of birth). Print the age group that the person belongs to: twenties, thirties, forties. If the integer is 1971 or less, print "You're too old." For 2002 and above, "You're too young." Sample Run 1: Enter the year of birth : 1998 You're in your twenties. Sample Run 2: Enter the year of birth : 1950 You're too old. Sample Run 3: Enter the year of birth : 1972 You're in your fourties. Sample Run 4: Enter the year of birth : 2017 You're too young.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Assume that N is a positive integer.Returns the sum from 1 to N inclusive, but omitting the numbers that are of type series1, meaning omit numbers that can be written as 1 + 2 + 3 + 4 + ... + k for some positive integer k. Hint: write a boolean function that checks if an integer is of typeseries1. For example, the first few series1 numbers are 1, 3, 6, 10, ...So, g11_3(10) returns 35since the numbers to add are: 2, 4, 5, 7, 8, 9, where weare not using 1, 3, 6 and 10 because they are of type series1. answer in python
HALP m + n = 2k + 2k = 4k therefore adding even numbers always gives an even number. The above is wrong because.... it doesn't consider the case when adding to odd numbers m and n are different so you cannot use 2k for both it doesn't consider what m and n are for particular values in the integers it doesn't consider the case when m is even and n is odd
C++ Write a program that flips a fair coin N times. It should calculate the number of times every sequence of consecutive heads appears the sequence of N coin flips. Suppose the result of flipping the coin 10 times is HTHTTHHTTT then a sequence of 1 consecutive heads appears 2 times; a sequence of 2 consecutive heads appears 1 time. Note N is an arbitrarily large number.
Q12,. A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers. Given a string s, return true if it is a palindrome, or false otherwise. Example 1: Input: s = "A man, a plan, a canal: Panama" Output: true Explanation: "amanaplanacanalpanama" is a palindrome. Example 2: Input: s = "race a car" Output: false Explanation: "raceacar" is not a palindrome..
IN STO a IN STO b test LDA a SUB b BRP count LDA c OUT LDA d OUT HLT count STO a LDA c ADD one STO c LDA d SUB b STO d BR test a DAT b DAT c DAT 0 one DAT 1 d DAT 0 Using this LMC program to solve a÷b=cRd where a = 20 b = 4 what is c and remainder d. IF a = 20 b = 4 c should be 5 and d should be 0. IS there reason to why i keep getting the remainder as 980
Write a program that calculate the values of (X + Y) x (X – Y) where X, Y = 0, 1, 2, …, 9and prints the following table:X|Y 0 1 2 3 4 5 6 7 8 90| 0 -1 -4 -9 -16 -25 -36 -49 -64 -811| 1 0 -3 -8 -15 -24 -35 -48 -63 -802| 4 3 0 -5 -12 -21 -32 -45 -60 -773| 9 8 5 0 -7 -16 -27 -40 -55 -724| 16 15 12 7 0 -9 -20 -33 -48 -655| 25 24 21 16 9 0 -11 -24 -39 -566| 36 35 32 27 20 11 0 -13 -28 -457| 49 48 45 40 33 24 13 0 -15 -328| 64 63 60 55 48 39 28 15 0 -179| 81 80 77 72 65 56 45 32 17 0
In the example below, the sum of the fourth powers of each digit that forms the 4-digit numbers gives the number itself: 1634 = 14 + 64 + 34 + 44 8208 = 84 + 24 + 04 + 84 9474 = 94 + 44 + 74 + 44 And sum of these numbers is 1634 + 8208 + 9474 = 19316. Find the sum of all numbers that can be written as the sum of the fifth forces of their numbers. (P.s.: You have to done it by C++)
C++ Programming Language: Enhance the code given by outputting: The largest number of the sequence a0 ,a1 ,a2 , ..., ak. The position of the largest number Test your program for the following values of x: 75, 111, 678, 732, 873, 2048, and 65535. Example: "For example, for the input sequence: 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the program output should contain the following: The largest number of the sequence is 340 The position of the largest number is 4" Code Given: #include <iostream> #include <iomanip> using namespace std; int main() { long x; int count; long a_n; cout << "Enter a nonnegative integer: "; cin >> x; cout << endl; count = 0; a_n = x; cout << a_n << ", "; while (a_n !=1) { if (a_n %2==0) a_n = a_n / 2; else a_n = 3 * a_n + 1; count++; cout << a_n <<", "; } cout << endl; cout << "The integer k such that a_k = 1 is " << count << endl; return0; }
Th e following sta tement should determine if x has a value other than 1 or 2.What is wrong with it?if (x ! = 1 11 x ! = 2)
in phython langauge: Write a program which reads the number of blocks the builders have,and outputs the height of the pyramids that can be built using these blocks.
A = {0,2,4,6} B = {{0},{2}, {4},{6}} C = A ∪ Ø D= A ∪ {Ø} E= { n ∈ ℕ | n² ∈ ℕ } F= { n² ∈ ℕ | n ∈ ℕ } Which are the following are true? 1. A ⊆ E, B ⊆ E, A ⊆ F, B ⊆ F, E ⊆ F, F ⊆ E. 2. O ∈ A, 0 ∈ B, {0} ∈ A, {0} ∈ B.
To represent an integer value of n in decimal, we need to use ⌈log10(n + 1)⌉ digits . Verify this using n = 35, 1290. Note that for any real number x, ⌈x⌉ is the smallest integer that is greater than x, this means we always round up. For example, ⌈10.3⌉ = 11, ⌈−5.2⌉ = −5. To represent an intege value of n in binary, we need to use ⌈log2(n + 1)⌉ binary digits . Verify this using n = 35, 1290. Use the definition of logarithmic function to show that log2n / log10n = log210