65 541
Assignments Done
99,2%
Successfully Done
In October 2018

Questions: 3 194

Free Answers by our Experts: 2 616

Many students face the C++ problems and have no idea how to cope with them. They start worrying about their results and feel miserable because of that. We don’t want you to be sad because of your C++ problems and want provide you with the C++ answers you are looking for. We know how many C++ questions are there in your head and we also know how important it is for you to get good marks. Let our service to look for the C++ answers for all your questions and make you sure that home assignment may be not that bad as you may think!

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

-Weight of Package (in Kilograms) = Rate per 300 miles shipped
-2 kg or less = $1.20 -Over 2 kg but not more than 6 kg =$2.20
-Over 6 kg but not more than 10 kg = $3.80 -Over 10 kg but not more than 20 kg =$4.80

Write a program that asks for the weight of the package and the distance it is to be shipped, then displays the charges with two decimal places. Input Validation: Do not accept values of 0 or less for the weight of the package. Do not accept weight of more than 20 kg (this is the maximum weight the company will ship.Do not accept distances of less than 10 miles or more than 3,000 miles. These are the company’s minimum and maximum shipping distances.
A bagel shop charges 75 cents per bagel for orders of less than a half-dozen bagels and 50 cents per bagel for orders of a half-dozen or more. Write a program that requests the number of bagels ordered and displays the price for each bagel and the total cost. Format the output results with two decimal places
#include <iostream>
#include <cstdlib>
using namespace std;

int main()
{
int num;

do
{
cout << "Enter an integer: ";
cin >> num;

cout << "\nNumber: " << num;

if (num > 0)
cout << "\nMagnitude: Positive";
else if (num < 0)
cout << "\nMagnitude: Negative";
else
cout << "\nMagnitude: Zero";

if (num % 2 == 0)
cout << "\nType: Even";
else
cout << "\nType: Odd";
cout << "\n\n";
}
while ();

return 0;
}

So I want the program to terminate the loop when the user enters a negative odd integer but I've been struggling to find the correct expression to fit.
For this project you will be designing and implementing a system, in either C or C++,to answer a few mathematical questions. First, given the number 123456789, is it possible to find a permutation (i.e. a rearrangement that preserves the count of each number) such that the left most digit is evenly divisible by 1, the two left most digits are evenly divisible by 2, the three left most digits are divisibly by 3 and so on?For example, in 123456789, 1 is evenly divisible by 1, 12 is evenly divisible by 2, 123 is evenly divisible by 3, but because 1234 is not evenly divisible by 4 this number is not a solution to the question.Second, is itpossible to find a similar permutation given the number 1234567890?Finally, is it possible to find a similar permutation for any of the given hexadecimal numbers, 1234567890AB, 1234567890ABC, 1234567890ABCD, 1234567890ABCDE, 1234567890ABCDEF?
design a program in for Bob's E-Z Loans. The Application accepts a client's loan amount and monthly payment amount. Output the customer loan balance each month till it's paid off.
// Continue playing as long as the game is not over
// (a team does not have a score of 15 or more
// with a difference of at least 2)

while (!((buffstate >= 15 || notredame >= 15) && (buffstate - notredame <= 2 || notredame - buffstate >= 2)))
Im not sure if my boolean expression is correct? The program executes, however its not following the (difference of at least 2 for the score)
2. The value of p can be approximated by using the following series:
-
¼ 4 1  1
3 þ
1
5  1
7 þþ
1
2n  1 þ
1
2n þ 1
 :
The following program uses this series to find the approximate value of p. However,
the statements are in the incorrect order, and there is also a bug in this program.
Rearrange the statements and also find and remove the bug so that this program can
be used to approximate p.#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double pi = 0;
long i;
long n;
cin >> n;
cout << "Enter the value of n: ";
cout << endl;
if (i % 2 == 0)
pi = pi + (1 / (2 * i + 1));
else
pi = pi - (1 / (2 * i + 1));
for (i = 0; i < n; i++)
{
pi = 0;
pi = 4 * pi;
}
cout << endl << "pi = " << pi << endl;
return 0;

Consider the following table:
Pay Code Pay Rate
1 8
2 14
5 10
6 20
7 15
9 16
11 20
Notice that the pay codes in the array are in ascending numerical order. The user will enter the
pay code to search for in the array. Write C++ program that should search for the pay code in the
first column of the array, but the search should begin in the middle row, which is row 4. If the pay
code the user is searching for is located in the first column of row 4, the program should display
the corresponding pay rate from the second column in row 4. If the pay code the user is
searching for is greater than the pay code in row 4’s first column, the search continues in rows 5,
6, and 7. However, if the pay code the user is searching for is less than the pay code in row 4’s
first column, the search should continue in rows 3, 2, and 1.
(40
Description of the Problem

Write a program to generate 3 random numbers in range 0-9. Let the user guess these three numbers. Display appropriate message to the user based on the following requirements:

Matching Numbers
Award
Any one matching
You won RM10
Two matching
You won RM100
Three matching, not in order
You won RM1000
Three matching in exact order
You won RM1,000,000
No matches
You won RM0

Sample Output 1
Enter the first digit of your guess 2
Enter the second digit of your guess 5
Enter the third digit of your guess 8
You guess was 2 5 8
and the random number was 1 0 7
You won $0 Sample Output 2 Enter the first digit of your guess 1 Enter the second digit of your guess 3 Enter the third digit of your guess 7 You guess was 1 3 7 and the random number was 1 0 7 You won$100
given the number 123456789, is it possible to find a permutation (i.e. a rearrangement that preserves the count of each number) such that the left most digit is evenly divisible by 1, the two left most digits are evenly divisible by 2, the three left most digits are divisibly by 3 and so on?
Submit