Largest Even and Odd N-digit numbers in Hexadecimal Number System
Last Updated :
21 Jan, 2022
Given an integer N, the task is to find the largest even and odd N-digit numbers in Hexadecimal Number System.
Examples:
Input: N = 1
Output:
Even: E
Odd: F
Input: N = 2
Output:
Even: FE
Odd: FF
Approach: To get the largest number, the digits of the number have to be maximum possible. Since in the hexadecimal number system, the maximum digit is ‘F’. So, generate ‘F’ (N – 1) times and then append ‘E’ for even and ‘F’ for odd in the end.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
void findNumbers( int n)
{
string ans = string(n - 1, 'F' );
string even = ans + 'E' ;
string odd = ans + 'F' ;
cout << "Even: " << even << endl;
cout << "Odd: " << odd << endl;
}
int main()
{
int n = 2;
findNumbers(n);
return 0;
}
|
Java
class GFG
{
static void findNumbers( int n)
{
String ans = string(n - 1 , 'F' );
String even = ans + 'E' ;
String odd = ans + 'F' ;
System.out.print( "Even: " + even + "\n" );
System.out.print( "Odd: " + odd + "\n" );
}
private static String string( int n, char c)
{
String str = "" ;
for ( int i = 0 ; i < n; i++)
str += c;
return str;
}
public static void main(String[] args)
{
int n = 2 ;
findNumbers(n);
}
}
|
Python3
def findNumbers(n) :
ans = 'F' * (n - 1 );
even = ans + 'E' ;
odd = ans + 'F' ;
print ( "Even: " , even);
print ( "Odd: " , odd);
if __name__ = = "__main__" :
n = 2 ;
findNumbers(n);
|
C#
using System;
class GFG
{
static void findNumbers( int n)
{
String ans = strings(n - 1, 'F' );
String even = ans + 'E' ;
String odd = ans + 'F' ;
Console.Write( "Even: " + even + "\n" );
Console.Write( "Odd: " + odd + "\n" );
}
private static String strings( int n, char c)
{
String str = "" ;
for ( int i = 0; i < n; i++)
str += c;
return str;
}
public static void Main(String[] args)
{
int n = 2;
findNumbers(n);
}
}
|
Javascript
<script>
function findNumbers(n)
{
var ans = "F" .repeat(n-1);
var even = ans + 'E' ;
var odd = ans + 'F' ;
document.write( "Even: " + even + "<br>" );
document.write( "Odd: " + odd + "<br>" );
}
var n = 2;
findNumbers(n);
</script>
|
Time Complexity: O(1)
Auxiliary Space: O(1)
Share your thoughts in the comments
Please Login to comment...