Given two integer m and n, the task is to find the sum of distinct digits of both the numbers and print YES if the both the sums are equal else print NO.
Examples:
Input: m = 2452, n = 9222
Output: YES
The sum of distinct digits of 2452 is 11 (2 + 4 + 5)
And of 9222 is 11 (9 + 2)Input: m = 121, n = 3035
Output: NO
Approach: Find the sum of unique digits of m and n and store them in sumM and sumN respectively. If sumM = sumN then print YES else print NO.
Below is the implementation of the above approach:
C++
// C++ program to check if the sum of distinct // digits of two integers are equal #include <iostream> using namespace std; // Function to return the sum of // distinct digits of a number int distinctDigitSum(int n) { bool used[10]; int sum = 0; while (n > 0) { // Take last digit int digit = n % 10; // If digit has not been used before if (!used[digit]) { // Set digit as used used[digit] = true; sum += digit; } // Remove last digit n = (int)n / 10; } return sum; } // Function to check whether the sum of // distinct digits of two numbers are equal string checkSum(int m, int n) { int sumM = distinctDigitSum(m); int sumN = distinctDigitSum(n); if (sumM != sumN) return "YES"; return "NO"; } // Driver code int main() { int m = 2452, n = 9222; cout << (checkSum(m, n)); return 0; } |
chevron_right
filter_none
Java
// Java program to check if the sum of distinct // digits of two integers are equal public class HelloWorld { // Function to return the sum of // distinct digits of a number static int distinctDigitSum(int n) { boolean used[] = new boolean[10]; int sum = 0; while (n > 0) { // Take last digit int digit = n % 10; // If digit has not been used before if (!used[digit]) { // Set digit as used used[digit] = true; sum += digit; } // Remove last digit n = n / 10; } return sum; } // Function to check whether the sum of // distinct digits of two numbers are equal static String checkSum(int m, int n) { int sumM = distinctDigitSum(m); int sumN = distinctDigitSum(n); if (sumM == sumN) return "YES"; return "NO"; } // Driver code public static void main(String[] args) { int m = 2452, n = 9222; System.out.println(checkSum(m, n)); } } |
chevron_right
filter_none
Python3
# Python3 program to check if the sum of # distinct digits of two integers are equal # Function to return the sum of # distinct digits of a number def distinctDigitSum(n) : used = [False] * 10 sum = 0 while (n > 0) : # Take last digit digit = n % 10 # If digit has not been used before if (not used[digit]) : # Set digit as used used[digit] = True sum += digit # Remove last digit n = n // 10 return sum # Function to check whether the sum of # distinct digits of two numbers are equal def checkSum(m, n) : sumM = distinctDigitSum(m) sumN = distinctDigitSum(n) if (sumM == sumN) : return "YES" return "NO" # Driver code if __name__ == "__main__" : m = 2452 n = 9222 print(checkSum(m, n)) # This code is contributed by Ryuga |
chevron_right
filter_none
C#
// C# program to check if the sum of distinct // digits of two integers are equal // Function to return the sum of // distinct digits of a number using System; public class GFG{ static int distinctDigitSum(int n) { bool []used = new bool[10]; int sum = 0; while (n > 0) { // Take last digit int digit = n % 10; // If digit has not been used before if (!used[digit]) { // Set digit as used used[digit] = true; sum += digit; } // Remove last digit n = n / 10; } return sum; } // Function to check whether the sum of // distinct digits of two numbers are equal static String checkSum(int m, int n) { int sumM = distinctDigitSum(m); int sumN = distinctDigitSum(n); if (sumM == sumN) return "YES"; return "NO"; } // Driver code static public void Main (){ int m = 2452, n = 9222; Console.WriteLine(checkSum(m, n)); } //This code is contributed by akt_mit } |
chevron_right
filter_none
PHP
<?php // PHP program to check if the sum of distinct // digits of two integers are equal // Function to return the sum of // distinct digits of a number function distinctDigitSum($n) { $used[10] = array(); $sum = 0; while ($n > 0) { // Take last digit $digit = $n % 10; // If digit has not been used before if ($used > 0) { // Set digit as used $used[$digit] = true; $sum += $digit; } // Remove last digit $n = (int)$n / 10; } return $sum; } // Function to check whether the sum of // distinct digits of two numbers are equal function checkSum($m, $n) { $sumM = distinctDigitSum($m); $sumN = distinctDigitSum($n); if ($sumM != $sumN) return "YES"; return "NO"; } // Driver code $m = 2452; $n = 9222; echo (checkSum($m, $n)); // This code is contributed by ajit.. ?> |
chevron_right
filter_none
Output:
YES
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Find any K distinct odd integers such that their sum is equal to N
- Numbers with sum of digits equal to the sum of digits of its all prime factor
- Find the first N integers such that the sum of their digits is equal to 10
- Check whether a number can be represented as sum of K distinct positive integers
- Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Find the number of positive integers less than or equal to N that have an odd number of digits
- Count distinct pairs from two arrays having same sum of digits
- Remove two consecutive integers from 1 to N to make sum equal to S
- Minimum digits to be removed to make either all digits or alternating digits same
- Represent (2 / N) as the sum of three distinct positive integers of the form (1 / m)
- Find K distinct positive odd integers with sum N
- Find N distinct integers with zero sum
- Find N distinct integers with sum N
- Check whether product of digits at even places is divisible by sum of digits at odd place of a number
- Check if the sum of digits of number is divisible by all of its digits
- Smallest number with given sum of digits and sum of square of digits
- Count numbers in given range such that sum of even digits is greater than sum of odd digits
- Add two integers of different base and represent sum in smaller base of the two
- Check if N can be represented as sum of squares of two consecutive integers
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
