C++ Basic
C++ Interview Programs
- C++ Interview Programs
- C++ Abundant Number
- C++ Amicable Number
- C++ Armstrong Number
- C++ Average of N Numbers
- C++ Automorphic Number
- C++ Biggest of three numbers
- C++ Binary to Decimal
- C++ Common Divisors
- C++ Composite Number
- C++ Condense a Number
- C++ Cube Number
- C++ Decimal to Binary
- C++ Decimal to Octal
- C++ Disarium Number
- C++ Even Number
- C++ Evil Number
- C++ Factorial of a Number
- C++ Fibonacci Series
- C++ GCD
- C++ Happy Number
- C++ Harshad Number
- C++ LCM
- C++ Leap Year
- C++ Magic Number
- C++ Matrix Addition
- C++ Matrix Division
- C++ Matrix Multiplication
- C++ Matrix Subtraction
- C++ Matrix Transpose
- C++ Maximum Value of an Array
- C++ Minimum Value of an Array
- C++ Multiplication Table
- C++ Natural Number
- C++ Number Combination
- C++ Odd Number
- C++ Palindrome Number
- C++ Pascalβs Triangle
- C++ Perfect Number
- C++ Perfect Square
- C++ Power of 2
- C++ Power of 3
- C++ Pronic Number
- C++ Prime Factor
- C++ Prime Number
- C++ Smith Number
- C++ Strong Number
- C++ Sum of Array
- C++ Sum of Digits
- C++ Swap Two Numbers
- C++ Triangular Number
C++ Program to Check Evil Number
Photo Credit to CodeToFun
π Introduction
In the realm of programming, understanding the properties of numbers is a fascinating journey. One interesting concept is that of Evil Numbers.
An Evil Number is a non-negative integer that has an even number of '1' bits in its binary representation.
In this tutorial, we will delve into a C++ program designed to check whether a given number is an Evil Number.
The program involves converting the decimal number to its binary representation and counting the number of '1' bits.
π Example
Let's dive into the C++ code that accomplishes this task.
#include <iostream>
// Function to count the number of set bits (1s) in binary representation
int countSetBits(int number) {
int count = 0;
while (number) {
count += number & 1;
number >>= 1;
}
return count;
}
// Function to check if a number is an Evil Number
bool isEvilNumber(int number) {
// Count the number of set bits in the binary representation
int setBitsCount = countSetBits(number);
// If the count of set bits is even, it is an Evil Number
return setBitsCount % 2 == 0;
}
// Driver program
int main() {
// Replace this value with the number you want to check
int number = 15;
// Call the function to check if the number is an Evil Number
if (isEvilNumber(number))
std::cout << number << " is an Evil Number.\n";
else
std::cout << number << " is not an Evil Number.\n";
return 0;
}
π» Testing the Program
To test the program with different numbers, modify the value of number in the main program.
15 is an Evil Number.
π§ How the Program Works
- The program defines a function countSetBits that takes an integer number as input and returns the count of set bits (1s) in its binary representation.
- The function isEvilNumber checks if the count of set bits is even, indicating that the number is an Evil Number.
- Inside the main program, replace the value of number with the desired number you want to check.
- The program calls the isEvilNumber function and prints the result.
π Between the Given Range
Let's explore the C++ code that checks for Evil Numbers in the specified range.
#include <iostream>
#include <bitset>
// Function to check if a number is Evil
bool isEvil(int num) {
std::bitset < 8 > binary(num);
return binary.count() % 2 == 0;
}
// Driver program
int main() {
std::cout << "Evil numbers in the range 1 to 10:\n";
for (int i = 1; i <= 10; ++i) {
if (isEvil(i)) {
std::cout << i << " ";
}
}
std::cout << std::endl;
return 0;
}
π» Testing the Program
Evil numbers in the range 1 to 10: 3 5 6 9 10
Compile and run the program to see the Evil Numbers in the range 1 to 10.
π§ How the Program Works
- The program defines a function isEvil that takes a number as input, converts it to its binary representation, and checks if the count of 1s is even.
- The main function iterates through the range from 1 to 10 and prints the Evil Numbers in the specified format.
π§ Understanding the Concept of Evil Number
Before delving into the code, let's understand the concept of Evil Numbers. An Evil Number is a non-negative integer that has an even number of '1' bits in its binary representation.
π’ Optimizing the Program
While the provided program is effective, consider exploring and implementing alternative approaches or optimizations for checking Evil Numbers.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (C++ Program to Check Evil Number), please comment here. I will help you immediately.