Check if the product of digit sum and its reverse equals the number or not
Last Updated :
17 Feb, 2023
Given a number, check whether the product of digit sum and reverse of digit sum equals the number or not.
Examples:
Input : 1729
Output : Yes
Explanation:
digit sum = 1 + 7 + 2 + 9
= 19
Reverse of digit sum = 91
Product = digit sum * Reverse of digit sum
= 19 * 91
= 1729
Input : 2334
Output : No
Flowchart:
Approach :
1. Find the sum of digits of a given number.
2. Reverse the digit sum output.
3. Product of digit sum and reverse of digit sum.
If the product equals to the original number then print “Yes” else print “No”.
C++
#include<bits/stdc++.h>
using namespace std;
int check( int num)
{
int digitSum = 0;
while (num > 0)
{
digitSum = digitSum + num % 10;
num = num / 10;
}
int temp = digitSum;
int reverseDigitSum = 0;
while (temp > 0)
{
int rem = temp % 10;
reverseDigitSum = reverseDigitSum * 10
+ rem;
temp = temp / 10;
}
int number = digitSum * reverseDigitSum;
return number;
}
int main()
{
int num = 1729;
int x = check(num);
if (num == x)
cout << "Yes" ;
else
cout << "No" ;
return 0;
}
|
Java
import java.io.*;
public class GFG {
static int check( int num)
{
int digitSum = 0 ;
while (num > 0 )
{
digitSum = digitSum + num % 10 ;
num = num / 10 ;
}
int temp = digitSum;
int reverseDigitSum = 0 ;
while (temp > 0 )
{
int rem = temp % 10 ;
reverseDigitSum = reverseDigitSum * 10
+ rem;
temp = temp / 10 ;
}
int number = digitSum * reverseDigitSum;
return number;
}
public static void main(String args[])
{
int num = 1729 ;
int x = check(num);
if (num == x)
System.out.println( "Yes" );
else
System.out.println( "No" );
}
}
|
Python3
def check(num) :
digitSum = 0
while (num ! = 0 ) :
digitSum = digitSum + num % 10
num = num / / 10
temp = ( int )(digitSum)
reverseDigitSum = 0
while (temp ! = 0 ) :
rem = temp % 10
reverseDigitSum = reverseDigitSum * 10 + rem
temp = temp / / 10
number = digitSum * reverseDigitSum
return number
num = 1729
x = (check(num))
if (num = = x) :
print ( "Yes" )
else :
print ( "No" )
|
C#
using System;
class GFG {
static int check( int num)
{
int digitSum = 0;
while (num > 0) {
digitSum = digitSum + num % 10;
num = num / 10;
}
int temp = digitSum;
int reverseDigitSum = 0;
while (temp > 0) {
int rem = temp % 10;
reverseDigitSum = reverseDigitSum * 10
+ rem;
temp = temp / 10;
}
int number = digitSum * reverseDigitSum;
return number;
}
public static void Main()
{
int num = 1729;
int x = check(num);
if (num == x)
Console.WriteLine( "Yes" );
else
Console.WriteLine( "No" );
}
}
|
PHP
<?php
function check( $num )
{
$digitSum = 0;
while ( $num > 0)
{
$digitSum = $digitSum +
$num % 10;
$num = (int)( $num / 10);
}
$temp = $digitSum ;
$reverseDigitSum = 0;
while ( $temp > 0)
{
$rem = $temp % 10;
$reverseDigitSum = $reverseDigitSum *
10 + $rem ;
$temp = (int)( $temp / 10);
}
$number = $digitSum * $reverseDigitSum ;
return $number ;
}
$num = 1729;
$x = check( $num );
if ( $num == $x )
echo ( "Yes" );
else
echo ( "No" );
?>
|
Javascript
<script>
function check(num)
{
var digitSum = 0;
while (num > 0) {
digitSum = digitSum + (num % 10);
num = parseInt(num / 10);
}
var temp = digitSum;
var reverseDigitSum = 0;
while (temp > 0) {
var rem = temp % 10;
reverseDigitSum =
reverseDigitSum * 10 + rem;
temp = parseInt(temp / 10);
}
var number = digitSum * reverseDigitSum;
return number;
}
var num = 1729;
var x = check(num);
if (num == x) document.write( "Yes" );
else document.write( "No" );
</script>
|
Time Complexity: O(log10(num))
Auxiliary Space: 1
Share your thoughts in the comments
Please Login to comment...