C++ Programming Problem: William Tucker is a well-known and currently he is cooking a big pizza in rectangle shape having grid of (X, Y), particular cell can be either empty or contain a pepperoni. After completely cooking the pizza now William wants to cut out a sub-rectangle from pizza, condition is that it should consists of even number of pepperonis. Now he required your help in developing a C++ program to find out the number of sub rectangles which contains even number of pepperonis. Test Case Output 3 22 11 01

C++ Programming Problem: William Tucker is a well-known and currently he is cooking a big pizza in rectangle shape having grid of (X, Y), particular cell can be either empty or contain a pepperoni. After completely cooking the pizza now William wants to cut out a sub-rectangle from pizza, condition is that it should consists of even number of pepperonis. Now he required your help in developing a C++ program to find out the number of sub rectangles which contains even number of pepperonis. Test Case Output 3 22 11 01

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter6: User-defined Functions

Section: Chapter Questions

Problem 17PE

See similar textbooks

Similar questions

I need help in coding the following practice problem using the fundamentals of C Programming Language without using arrays. The New Telephone Company has the following rate structure for long-distance calls:a) Any call started after 6:00 P.M. gets a 50% discount.b) Any call started after 8:00 A.M. is charged full price.c) All calls are subject to a 4% tax.d) The regular rate for a call is /P5.00 per minute.e) Any call longer than 60 minutes receives a 15% discount on its cost(after anyother discount is taken but before tax is added).Write a program that processes several calls by reading the start time for each call andthe length of each call. The gross cost (before any discounts or tax) should be printedfollowed by the net cost (after discounts are deducted and tax is added).
Write a code in C++ / cpp to solve the following problem In a hypothetical island, one can buy land in squares where the length of a square side must be a positive integer amount of meters. Buying a square of land with a side a costs a2 rhombics (a local currency). Sasha has decided to invest all of her N rhombics into the land. She can, surely, do it, buying square pieces 1 × 1 meters. At the same time she has requested to minimize the amount of pieces she buys. Can you find out the number of pieces she has bought ? Input The only line contains a positive integer N ≤ 60 000 , that is a number of rhombics that Sasha has invested. Output The only line contains the number of pieces she has bought. Sample 1 Input: 344 Output: 3
Write a C++ function using recursion that returns the Greatest Common Divisor of two integers. The greatest common divisor (gcd) of two integers, which are not zero, is the largest positive inteteger that divides each of the integers. The code should follow the exact function declaration: int GCD(int number1, int number2);
NEED A PROGRAM CODE IN C++ A geometric sequence is a sequence of numbers where each term after the first isfound by multiplying the previous one by a fixed, non -zero number calledthe common ratio. For example, the sequences2, 6, 18, ....3,15,75, ….are a geometric sequences with common ratios 3 and 5 respectively. A geometricsequence is generally characterized by three numbers, the first term ‘a’, thecommon ratio ‘r’ and the number of terms ‘n’. A geometric series is the sum ofnumbers in a geometric sequence. 2+6+18 and 3+15+75 are examples of geometricseries with three terms each.The nth term of a geometric series with initial value ‘a’ and common ratio ‘r’ isgiven by: ?? = ???-1. While the sum of a geometric series is given by:?(1 - ??)1 - ?Create a class GeometricSeries to model a Geometric series. Using friend function,overload the ‘~’ operator to find the nth term of the series. Likewise, overload the‘!’ operator (using a friend function) to find the sum of a Geometric…
I need a code for this in C: Define and Implement the following functions: float Area_Rect(float length, float width) - returns the computed area of a rectangle where: AR=length x width float Peri_Rect(float length, float width) - returns the computed perimeter of a rectangle where: pR= 2 x (L+W); float Diag_Line(float length, float width) - returns the computed diagonal line of a rectangle using the formula: dLine= sqrt(length x length+width x width) float Area_Tria(float length,float width) - returns the computed area of a triangle: aT= (length x width)/2 Create a function main() that will accept inputted values for the length and width of a rectangle. Invoke each functions given above and print the returned value of each function.
The first few numbers in the series of Lucas numbers are: {1; 3; 4; 7; 11; 18; ... ; LN} The Lucas-numbers are determined by: (?1 = 1, ?2 = 3, ??+2 = ??+1 + ?? ) That is, a Lucas number is calculated as the sum of its two immediate previous terms in the Lucas series. Using this information, write a C/C++ program that defines a function Lucas() that calculates the n th number in a Lucas number sequence, where the user enters n into the program interactively. For example, if n=6, the program should display the value 18. The function accepts one integer parameter for the value of n and returns the result to the calling statement in main(). See the example output in Figure 2.2.
Implement in C Programming 6.4.1: Function definition: Volume of a pyramid with modular functions. Define a function CalcPyramidVolume with double data type parameters baseLength, baseWidth, and pyramidHeight, that returns as a double the volume of a pyramid with a rectangular base. CalcPyramidVolume() calls the given CalcBaseArea() function in the calculation.Relevant geometry equations:Volume = base area x height x 1/3Base area = base length x base width.(Watch out for integer division). #include <stdio.h> double CalcBaseArea(double baseLength, double baseWidth) { return baseLength * baseWidth;} /* Your solution goes here */ int main(void) { double userLength; double userWidth; double userHeight; scanf("%lf", &userLength); scanf("%lf", &userWidth); scanf("%lf", &userHeight); printf("Volume: %lf\n", CalcPyramidVolume(userLength, userWidth, userHeight)); return 0;}
The first few numbers in the series of Lucasnumbers are:{1; 3; 4; 7; 11; 18; ... ; LN}The Lucas-numbers are determined by:(?1 = 1, ?2 = 3, ??+2 = ??+1 + ??)That is, a Lucas number is calculated as the sumof its two immediate previous terms in the Lucasseries.Using this information, write a C/C++ program thatdefines a function Lucas() that calculates the nthnumber in a Lucas number sequence, where theuser enters n into the program interactively. Forexample, if n=6, the program should display thevalue 18.The function accepts one integer parameter for thevalue of n and returns the result to the callingstatement in main().See the example output in Figure 2.2.
C Program: An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 = 1 + 2 + 3. I have written a function called isPerfect (see below), that determines whether parameter passed to the function is a perfect number. Use this function in a C program that determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. // isPerfect returns true if value is perfect integer, // i.e., if value is equal to sum of its factors int isPerfect(int value) { int factorSum = 1; // current sum of factors // loop through possible factor values for (int i = 2; i <= value / 2; ++i) { // if i is factor if (value % i == 0) { factorSum += i; // add to sum } } // return true if value is equal to sum of factors if (factorSum == value) { return…
4-write functions to write a C++ program for solving the following computational problem: a)-Find the smallest Fibonacci number greater than 1,000,000 and greater than 1,000,000,000.
Develop a code that gets two integers from the user and calculates and prints their least common multiplier or LCM. LCM is the smallest number that divides both given integers. Example. lcm (10, 15) = 30, lcm (5,7) = 35 and lcm (12, 24) = 24Hint: we know that lcm(x,y) = xy/gcd(x,y) where gcd is the greatest common divisor (discussed in class). Develop a gcd function in your code, get the two numbers from the user, call your function to calculate their gcd and then use the formula above to calculate and display their lcm GOOD LUCK! Reference This is a list of function prototypes of the C library functions presented in class. You may use any of these functions in your solutions (unless the requirements explicitly indicate otherwise). As you have been provided the function prototypes, you are expected to use the functions correctly in your solutions. double atof(char *string); int atoi(char *string); long atol(char *string); int fclose(FILE *filePointer); char *fgets(char…
In C++ without classes, given a time in 24-hour notation, write a function that adds 2 times, a function that substracts 2 times, and a function that displays the time in 12-hour notation.