Given two piles of coins consisting of N and M coins, the task is to check if both the piles can be emptied simultaneously by repeatedly removing 2 coins from one pile and 1 coin from the other pile. If both the piles can be made empty, then print “Yes”. Otherwise, print “No”.
Examples:
Input: N = 1, M = 2 Output: Yes Explanation: Remove 1 coin from 1st pile and 2 coins from the other pile. Therefore, the number of coins in both the piles is 0.
Input: N = 2, M = 2 Output: No
Approach: The given problem can be solved based on the following observations:
- There are two ways to remove coins from piles, i.e. either remove 2 coins from pile 1 and 1 coin from pile 2 or 1 coin from pile 1 and 2 coins from pile 2.
- Let X be the number of moves made for the first removal and Y be the number of moves made for the second removal, then the remaining number of coins in the two piles are (N – 2*X – Y) and (M – 2*Y – X) respectively.
- After performing (X + Y) moves, the piles must be emptied i.e.,
(N – 2*X – Y) = 0 and (M – 2*Y – X) = 0
Rearranging terms in the above equations generates the equations:
N = 2*X + Y and M = 2*Y + X
- The total number of coins in both piles is (N + M) = (2*X + Y) + (X + 2*Y) = 3(X + Y).
- Therefore, to make both the piles empty, below are the conditions:
- The sum of the coins in both piles should be a multiple of 3.
- The maximum of N and M must less than twice the minimum of N and M as one whole pile will become empty and some coins will still be left in another one. Therefore, the size of the larger pile should not be more than twice the size of the smaller pile.
Therefore, the idea is to check if the sum of total number of coins is a multiple of 3 and the maximum number of coins is at most twice the minimum number of coins, then print “Yes”. Otherwise, print “No”.
Below is the implementation of the above approach:
C++
// C++ program for the above approach#include <bits/stdc++.h>using namespace std;// Function to check if two given piles// can be emptied by repeatedly removing// 2 coins from a pile and 1 coin from the othervoid canBeEmptied(int A, int B){ // If maximum of A & B exceeds // the twice of minimum of A & B if (max(A, B) > 2 * min(A, B)) { // Not possible to // empty the piles cout << "No"; return; } // If sum of both the coins is // divisible by 3, then print Yes if ((A + B) % 3 == 0) cout << "Yes"; // Otherwise, print "No" else cout << "No";}// Driver Codeint main(){ int A = 1, B = 2; canBeEmptied(A, B); return 0;} |
Java
// Java program for above approachimport java.util.*;class GFG{// Function to check if two given piles// can be emptied by repeatedly removing// 2 coins from a pile and 1 coin from the otherstatic void canBeEmptied(int A, int B){ // If maximum of A & B exceeds // the twice of minimum of A & B if (Math.max(A, B) > 2 * Math.min(A, B)) { // Not possible to // empty the piles System.out.println("No"); return; } // If sum of both the coins is // divisible by 3, then print Yes if ((A + B) % 3 == 0) System.out.println("Yes"); // Otherwise, print "No" else System.out.println("No");}// Driver Codepublic static void main (String[] args){ int A = 1, B = 2; canBeEmptied(A, B);}}// This code is contributed by sanjoy_62 |
Python3
# Python3 program for the above approach# Function to check if two given piles# can be emptied by repeatedly removing# 2 coins from a pile and 1 coin from the otherdef canBeEmptied(A, B): # If maximum of A & B exceeds # the twice of minimum of A & B if (max(A, B) > 2 * min(A, B)): # Not possible to # empty the piles print("No") return # If sum of both the coins is # divisible by 3, then print Yes if ((A + B) % 3 == 0): print("Yes") # Otherwise, print "No" else: print("No")# Driver Codeif __name__ == '__main__': A = 1 B = 2 canBeEmptied(A, B) # This code is contributed by bgangwar59. |
C#
// C# program for the above approachusing System;class GFG{// Function to check if two given piles// can be emptied by repeatedly removing// 2 coins from a pile and 1 coin from the otherstatic void canBeEmptied(int A, int B){ // If maximum of A & B exceeds // the twice of minimum of A & B if (Math.Max(A, B) > 2 * Math.Min(A, B)) { // Not possible to // empty the piles Console.WriteLine("No"); return; } // If sum of both the coins is // divisible by 3, then print Yes if ((A + B) % 3 == 0) Console.WriteLine("Yes"); // Otherwise, print "No" else Console.WriteLine("No");}// Driver Codepublic static void Main (){ int A = 1, B = 2; canBeEmptied(A, B);}}// This code is contributed by mohit kumar 29 |
Javascript
<script>// Javascript program for the above approach// Function to check if two given piles// can be emptied by repeatedly removing// 2 coins from a pile and 1 coin from the otherfunction canBeEmptied(A, B){ // If maximum of A & B exceeds // the twice of minimum of A & B if (Math.max(A, B) > 2 * Math.min(A, B)) { // Not possible to // empty the piles document.write("No"); return; } // If sum of both the coins is // divisible by 3, then print Yes if ((A + B) % 3 == 0) document.write("Yes"); // Otherwise, print "No" else document.write("No");}// Driver Codelet A = 1, B = 2;canBeEmptied(A, B);// This code is contributed by subhammahato348</script> |
Time Complexity: O(1) // since no loop is used the algorithm takes constant time for all the operations
Auxiliary Space: O(1) // since no extra array is used the space taken by the algorithm is constant
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
