Check if an Octal number is Even or Odd
Last Updated :
20 Dec, 2022
Given an Octal number N, check whether it is even or odd.
Examples:
Input: N = 7234
Output: Even
Input: N = 333333333
Output: Odd
Naive Approach:
Time Complexity: O(N)
Efficient approach: Since Octal numbers contain digits from 0 to 7, therefore we can simply check if the last digit is either ‘0’, ‘2’, ‘4’ or ‘6’ . If it is, then the given Octal number will be Even, else Odd.
Below is the implementation of the above approach.
C++
#include <bits/stdc++.h>
using namespace std;
string even_or_odd(string N)
{
int len = N.size();
if (N[len - 1] == '0'
|| N[len - 1] == '2'
|| N[len - 1] == '4'
|| N[len - 1] == '6' )
return ( "Even" );
else
return ( "Odd" );
}
int main()
{
string N = "735" ;
cout << even_or_odd(N);
return 0;
}
|
Java
import java.io.*;
class GFG{
static String even_or_odd(String N)
{
int len = N.length();
if (N.charAt(len - 1 ) == '0'
|| N.charAt(len - 1 ) == '2'
|| N.charAt(len - 1 ) == '4'
|| N.charAt(len - 1 ) == '6' )
return ( "Even" );
else
return ( "Odd" );
}
public static void main(String[] args)
{
String N = "735" ;
System.out.print(even_or_odd(N));
}
}
|
Python 3
def even_or_odd( N):
l = len (N);
if (N[l - 1 ] = = '0' or N[l - 1 ] = = '2' or
N[l - 1 ] = = '4' or N[l - 1 ] = = '6' ):
return ( "Even" )
else :
return ( "Odd" )
N = "735"
print (even_or_odd(N))
|
C#
using System;
public class GFG{
static String even_or_odd(String N)
{
int len = N.Length;
if (N[len - 1] == '0'
|| N[len - 1] == '2'
|| N[len - 1] == '4'
|| N[len - 1] == '6' )
return ( "Even" );
else
return ( "Odd" );
}
public static void Main(String[] args)
{
String N = "735" ;
Console.Write(even_or_odd(N));
}
}
|
Javascript
<script>
function even_or_odd(N)
{
var len = N.length;
if (N[len - 1] == '0'
|| N[len - 1] == '2'
|| N[len - 1] == '4'
|| N[len - 1] == '6' )
return ( "Even" );
else
return ( "Odd" );
}
var N = "735" ;
document.write(even_or_odd(N));
</script>
|
Time Complexity: O(1)
Auxiliary Space: O(1)
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...