Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Evil Number

  • Difficulty Level : Basic
  • Last Updated : 23 Jun, 2021

An evil number is a non-negative number that has an even number of 1s in its binary expansion. (Binary Expansion – is representation of a number in the binary numeral system or base-2 numeral system which represents numeric values using two different symbols: typically 0 (zero) and 1 (one)).

Odious Numbers: Numbers that are not Evil are called Odious Numbers. Given a number, the task is to check if it is Evil Number or Odious Numbers.

 Examples : 

Input : 3
Output : Evil Number
Explanation: Binary expansion of 3 is 11,
the number of 1s in this is 2 i.e even. 

Input : 16
Output : Odious Number(not an evil number)
Explanation: Binary expansion of 16 = 10000, 
having number of 1s =1 i.e odd.

Input : 23
Output : Evil Number
Explanation: Binary expansion of 23 is 10111,
the number of 1s in this is 4 i.e even.

C++




// C/C++ program to check if a number is
// Evil number or Odious Number
#include <iostream>
using namespace std;
#include <math.h>
 
// returns number of 1s from the binary number
int count_one(int n)
{
    int c_one = 0;
    while (n != 0) {
        int rem = n % 10;
 
        // counting 1s
        if (rem == 1)
            c_one = c_one + 1;
        n = n / 10;
    }
    return c_one;
}
 
// Check if number is evil or not
int checkEvil(int n)
{
    int i = 0, bin = 0, n_one = 0;
 
    // converting n to binary form
    while (n != 0) {
        // calculating remainder
        int r = n % 2;
 
        // storing the remainders in binary
        // form as a number
        bin = bin + r * (int)(pow(10, i));
        n = n / 2;
    }
 
    // Calling the count_one function to count
    // and return number of 1s in bin
    n_one = count_one(bin);
    if (n_one % 2 == 0)
        return 1;
    else
        return 0;
}
 
// Driver Code
int main(void)
{
    int i, check, num;
    num = 32;
    check = checkEvil(num);
    if (check == 1)
        cout << num << " is Evil Number\n";
    else
        cout << num << " is Odious Number\n";
    return 0;
}
 
// This code is contributed by Nikita Tiwari.
Java



// Java program to check if a number is
// Evil number or Odious Number
 
class GFG {
    // returns number of 1s from the binary number
    static int count_one(int n)
    {
        int c_one = 0;
        while (n != 0) {
            int rem = n % 10;
 
            // counting 1s
            if (rem == 1)
                c_one = c_one + 1;
            n = n / 10;
        }
        return c_one;
    }
 
    // Check if number is evil or not
    static int checkEvil(int n)
    {
        int i = 0, bin = 0, n_one = 0;
 
        // converting n to binary form
        while (n != 0) {
            // calculating remainder
            int r = n % 2;
 
            // storing the remainders in binary
            // form as a number
            bin = bin + r * (int)(Math.pow(10, i));
            n = n / 2;
        }
 
        // Calling the count_one function to count
        // and return number of 1s in bin
        n_one = count_one(bin);
        if (n_one % 2 == 0)
            return 1;
        else
            return 0;
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        int i, check, num;
        num = 32;
        check = checkEvil(num);
        if (check == 1)
            System.out.println(num + " is Evil Number");
        else
            System.out.println(num + " is Odious Number");
    }
}
 
/* This code is contributed by Mr. Somesh Awasthi */
Python



# Python program to check if a number is
# Evil number or Odious number
 
# returns number of 1s from the binary number
def count_one(n):
    c_one = 0
    while n != 0:
        rem = n % 10
         
        # Counting 1s
        if rem == 1:
            c_one = c_one + 1
        n = n / 10
         
    return c_one
 
# Check if number is evil or not
def checkEvil(n):
    i = 0
    binary = 0
     
    # Converting n to binary form
    while n != 0:
        r = n % 2
        # Calculating Remainder
        # Storing the remainders in binary
        # form as a number
        binary = binary + r*(int(10**i))
        n = n / 2
         
    # Calling the count_one function to count
    # and return number of 1s in bin
    n_one = count_one(binary)
    if n_one % 2 == 0:
        return True
    return False
     
# Driver Code
num = 32
check = checkEvil(num)
if check:
    print num, "is Evil Number"
else:
    print num, "is Odious Number"       
         
# Contributed by Harshit Agrawal       
C#



// C# program to check if a number is
// Evil number or Odious Number
using System;
 
class GFG {
 
    // Returns number of 1s from
    // the binary number
    static int count_one(int n)
    {
        int c_one = 0;
        while (n != 0) {
            int rem = n % 10;
 
            // counting 1s
            if (rem == 1)
                c_one = c_one + 1;
            n = n / 10;
        }
        return c_one;
    }
 
    // Check if number is evil or not
    static int checkEvil(int n)
    {
        int i = 0, bin = 0, n_one = 0;
 
        // converting n to binary form
        while (n != 0) {
            // calculating remainder
            int r = n % 2;
 
            // storing the remainders in
            // binary form as a number
            bin = bin + r * (int)(Math.Pow(10, i));
            n = n / 2;
        }
 
        // Calling the count_one function to count
        // and return number of 1s in bin
        n_one = count_one(bin);
        if (n_one % 2 == 0)
            return 1;
        else
            return 0;
    }
 
    // Driver Code
    public static void Main(String[] args)
    {
        int check, num;
        num = 32;
        check = checkEvil(num);
        if (check == 1)
            Console.WriteLine(num + " is Evil Number");
        else
            Console.WriteLine(num + " is Odious Number");
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// PHP program to check if
// a number is Evil number
// or Odious Number
 
// returns number of 1s
// from the binary number
function count_one($n)
{
    $c_one = 0;
    while ($n != 0)
    {
        $rem = $n % 10;
         
        // counting 1s
        if ($rem == 1)
            $c_one = $c_one + 1;
        $n = $n / 10;
    }
    return $c_one;
}
 
// Check if number
// is evil or not
function checkEvil($n)
{
    $i = 0; $bin = 0; $n_one = 0;
     
    // converting n
    // to binary form
    while ($n != 0)
    {
        // calculating remainder
        $r = $n % 2;
         
        // storing the remainders
        // in binary form as a number
        $bin = $bin + $r * (pow(10, $i));
        $n = $n / 2;
    }
     
    // Calling the count_one
    // function to count and
    // return number of 1s in bin
    $n_one = count_one($bin);
    if ($n_one % 2 == 0)
        return 1;
    else
        return 0;
}
 
// Driver Code
$i; $check; $num;
$num = 32;
$check = checkEvil($num);
if ($check == 1)
    echo $num, " is Evil Number\n";
else
    echo $num, " is Odious Number\n";
 
// This code is contributed by ajit.
?>
Javascript



<script>
 
// Javascript program to check if a number
// is Evil number or Odious Number
 
// Returns number of 1s from
// the binary number
function count_one(n)
{
    let c_one = 0;
     
    while (n != 0)
    {
        let rem = n % 10;
 
        // Counting 1s
        if (rem == 1)
            c_one = c_one + 1;
             
        n = parseInt(n / 10, 10);
    }
    return c_one;
}
 
// Check if number is evil or not
function checkEvil(n)
{
    let i = 0, bin = 0, n_one = 0;
 
    // Converting n to binary form
    while (n != 0)
    {
         
        // Calculating remainder
        let r = n % 2;
 
        // Storing the remainders in
        // binary form as a number
        bin = bin + r * (Math.pow(10, i));
        n = parseInt(n / 2, 10);
    }
 
    // Calling the count_one function to count
    // and return number of 1s in bin
    n_one = count_one(bin);
     
    if (n_one % 2 == 0)
        return 1;
    else
        return 0;
}
 
// Driver code
let check, num;
num = 32;
check = checkEvil(num);
 
if (check == 1)
  document.write(num + " is Evil Number");
else
  document.write(num + " is Odious Number");
   
// This code is contributed by suresh07  
 
</script>
Output : 
32 is Odius Number
This article is contributed by Nikita Tiwari. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 

My Personal Notes
arrow_drop_up
Previous
Split N^2 numbers into N groups of equal sum
Next

Find sum of exponents of prime factors of numbers 1 to N
Recommended Articles
Page :
Number of factors of very large number N modulo M where M is any prime number
31, Mar 20
Permutation of a number whose sum with the original number is equal to another given number
18, Feb 21
Minimum number of moves to make M and N equal by repeatedly adding any divisor of number to itself except 1 and the number
12, Jul 21
Find minimum number to be divided to make a number a perfect square
19, Jan 17
Find n'th number in a number system with only 3 and 4
03, Oct 14
Count number of subsets of a set with GCD equal to a given number
01, Nov 15
Querying maximum number of divisors that a number in a given range has
04, Nov 16
Number with maximum number of prime factors
07, Mar 17
Convert a number m to n using minimum number of given operations
08, May 17
Determine whether a given number is a Hyperperfect Number
17, May 17
Number of times the largest perfect square number can be subtracted from N
08, Apr 19
Find if a number is divisible by every number in a list
23, Jun 17
Round-off a number to a given number of significant digits
04, Jul 17
Program to calculate the number of odd days in given number of years
10, Apr 19
Number of times a number can be replaced by the sum of its digits until it only contains one digit
16, Jul 17
Total number of divisors for a given number
10, Sep 17
Program to check whether the given number is Buzz Number or not
13, Aug 17
Check if a number is divisible by all prime divisors of another number
18, Oct 17
Largest number less than N whose each digit is prime number
19, Oct 17
Number of digits to be removed to make a number divisible by 3
08, Nov 17
Check if given number is Emirp Number or not
15, Dec 17
k-Rough Number or k-Jagged Number
10, Apr 18
Given a number N in decimal base, find number of its digits in any base (base b)
12, Apr 18
Number of digits in the nth number made of given four digits
07, May 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Basic





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!