w3resource

C++ Exercises: Accept two integers and return true if either one is 5 or their sum or difference is 5

C++ Basic Algorithm: Exercise-38 with Solution

Write a C++ program that accepts two integers and returns true if either one is 5 or their sum or difference is 5.

Sample Solution:

C++ Code :

#include <iostream>
 
using namespace std;

bool test(int x, int y)
        {
            return x == 5 || y == 5 || x + y == 5 || abs(x - y) == 5;
        }
     
        
int main() 
 {
  cout << test(5, 4) << endl; 
  cout << test(4, 3) << endl; 
  cout << test(1, 4) << endl;     
  return 0;      
}

Sample Output:

1
0
1

Pictorial Presentation:

C++ Basic Algorithm Exercises: Accept two integers and return true if either one is 5 or their sum or difference is 5.

Flowchart:

Flowchart: Accept two integers and return true if either one is 5 or their sum or difference is 5.

C++ Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a C++ program to compute the sum of the two given integers. If the sum is in the range 10..20 inclusive return 30.
Next: Write a C++ program to test if a given non-negative number is a multiple of 13 or it is one more than a multiple of 13.

What is the difficulty level of this exercise?



Follow us on Facebook and Twitter for latest update.

C++ Programming: Tips of the Day

Why does the C++ map type argument require an empty constructor when using []?

This issue comes with operator[]. Quote from SGI documentation:

data_type&operator[](constkey_type& k) - Returns a reference to the object that is associated with a particular key. If the map does not already contain such an object, operator[] inserts the default object data_type().

If you don't have default constructor you can use insert/find functions. Following example works fine:

myMap.insert(std::map<int, MyClass>::value_type ( 1, MyClass(1) ) );
myMap.find( 1 )->second;

Ref: https://bit.ly/3PQBRJi

 





We are closing our Disqus commenting system for some maintenanace issues. You may write to us at reach[at]yahoo[dot]com or visit us at Facebook