Please use the python programming and no 'range' only while loops. Examples :INPUTOUTPUT35 , 90 , 100 , 83 , 2,62, -199 , 34 , 99 , -179, 30 , 85 , 74,0,74, 81, 55, -1There were more 'B' grades than 'C' gradesThere were an equal number of 'B' and 'C' gradesThere were more 'C' grades than 'B' gradesThere were an equal number of 'B' and 'C' grades-144, 80 , 89, 72, 100, 80 -1There were more 'B' grades than 'C' grades Problem : More 'B' or 'C' Grades?Dr. Ely has a stack of graded exams on his desk. All grades are integers with the lowest possible gradebeing a 0 and the highest possible grade being 100. He would like to know if more students got a gradein the 'B' range or a grade in the 'C' range on the exam (the lowest score for a 'C' is a 70, the lowest for a'B' is an 80, and the lowest for an 'A' is 90. There is no such thing as a C- or C+, these scores are all just a'C' grade. The 'B' grades work in a similar fashion).Write a program that allows Dr. Ely to input each exam score into the program, one at a time, until Dr.Ely terminates input by typing in a -1. The program should correctly print one of the following threemessages:1) There were more 'B' grades than 'C' grades2) There were more 'C' grades than 'B' grades3) There were an equal number of 'B' and 'C' grades

INPUT OUTPUT 35 , 90 , 100 , 83 , 2 , 62 , -1 99 , 34 , 99 , -1 79, 30 , 85 , 74 ,0,74, 81,55, -1 There were more 'B' grades than 'C' grades There were an equal number of 'B' and 'C' grades There were more 'C' grades than 'B' grades There were an equal number of 'B' and 'C' grades There were more 'B' grades than 'C' grades -1 44, 80 , 89, 72, 100, 80 -1

INPUT OUTPUT 35 , 90 , 100 , 83 , 2 , 62 , -1 99 , 34 , 99 , -1 79, 30 , 85 , 74 ,0,74, 81,55, -1 There were more 'B' grades than 'C' grades There were an equal number of 'B' and 'C' grades There were more 'C' grades than 'B' grades There were an equal number of 'B' and 'C' grades There were more 'B' grades than 'C' grades -1 44, 80 , 89, 72, 100, 80 -1

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

program in python the following problem We ask that you assist the ITPC by indicating the maximum total number of letters that can be printed on a set of N shirts that are valid to be worn by both teams. For example, if “PÉREZ”, “GONZÁLEZ” and “LÓPEZ” play in the U-18 team, while “GARCIA”, “PERALTA” and “RODRÍGUEZ” play in the U-21 team, the best thing is that a jersey has the prefix "G" with 1 letter (for "GONZALEZ" and "GARCIA" to use), another has the prefix "PER" with 3 letters (for "PÉREZ" and "PERALTA" to use), and another has a 0-letter prefix (to be used by “LOPEZ” and “RODRIGUEZ”). Thus, the answer in this case is 1 + 3 + 0 = 4. Entry Each test case is described using three lines. The first line contains an integer N that indicates the number of players in each of the two teams (1≤N≤104). The second line contains the surnames of the N players of the U-18 team. The third line contains the surnames of the N players of the U21 team. Each last name is a non-empty string of at…
You have an array of 10,000 subject scores for a high-school exam and you want to find the scores that are ranked from 4900 to 5100 that is the 201 most middle-ranked scores. Precisely describe two alternative algorithmic ap proaches to doing this - one of which is, in terms of time complexity, more efficient than the other.
I need to write a recursive program to count the number of muck-free regions in a lagoon. The Lagoon is represented by a rectangle of N x M squares. Each square contains either muck ('M') or sand ('.'). A region is defined as a connected set of one of more squares with sand in it, where a square is considered to connect to all eight of its adjacent squares. Sample input/output is shown in picture attached
Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for the rugged hero to tame it, positive integers can be broken down as sums of consecutive positive integers in various ways. For example, the integer 42 often used as placeholder in this kind of discussions can be broken down into such a sum in four different ways: (a) 3 + 4 + 5 + 6 + 7 + 8 + 9, (b) 9 + 10 + 11 + 12, (c) 13 + 14 + 15 and (d) 42. As the last solution (d) shows, any positive integer can always be trivially expressed as a singleton sum that consists of that integer alone. Given a positive integer n, determine how many different ways it can be expressed as a sum of consecutive positive integers, and return that count. The number of ways that a positive integer n can be represented as a sum of consecutive integers is called its politeness, and can also be computed by tallying up the number of odd divisors of that number. However, note that the linked Wikipedia de0inition…
The Traveling Salesman Problem in Paris - An Optimal Tour Considering a Multimodal Transportation System Give an example and write suitable code. i posted 2 times this question but all are giving wrong ans give accurate ans otherwise you will get downvote
Correct answer will be upvoted else downvoted. Computer science. Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8. We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that a has no less than 4 divisors; contrast between any two divisors of an is essentially d. Input The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains a solitary integer d (1≤d≤10000). Output For each experiment print one integer a — the response for this experiment.
by using c++ .We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision. Recall the following formula for distance between two points p and q. Euclidean distance d( p , q ) = sqrt[(qx − px)^2 + (qy − py)^2]The Brute force solution is O(n^2), compute the distance between each pair and return the smallest. Find the smallest distance in O(nLogn) time using Divide and Conquer strategy.
The three integers n, I and j, with I and j being between 1 and 2n, are the prerequisites to the issue. You have a board of squares that is 2n by 2n squares. Each tile has an adequate amount of pieces and the desired form. With the exception of the solitary square at position I j, you must cover every 2n 2n tile on the board by placing nonoverlapping tiles. Provide a recursive method for this issue where you lay one tile on your own and then enlist the aid of four buddies. a case is a phrase, right?
May you please solve quick within 20-40 minutes ? There are two types of personnel working in a government office, workers and civil servants. The salary of the worker personnel is calculated by multiplying the number of days worked and the daily wage, and the salary of the civil servant personnel is calculated by multiplying the title score (0-1000), the score he will get according to the language level (100 if A is entered, 80 if B is entered, 60 if C is entered, the rest is 0) by 30. Write the C program, in which the personnel type can be entered as upper or lower case letters as W(Worker), O(Officer) and which calculates the wage to be paid to the person according to the values that are the basis for the calculation, and displays it on the screen. Also it is required that, to check the employee type you need define checkEmployee function. To calculate the title score you need to define checkTitleScore function. And finally to get the language level you need to define…
c++ Implement a function that recursively calculates the nth number in the Fibonacci sequence of numbers. The Fibonacci sequence starts at 0 and 1. Each number thereafter is the sum of the two preceding numbers. This gives us the following first ten numbers: 0,1,1,3,5,8,13,21,34, .... Input Expected output0 01 17 139 34
In order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test case contains…
Write a program in python that solves the following exercise, need an explanation of the solution: Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.