Given a one/two digit timing, calculate the possibilities of occurrence of other timings(including the glowing one) with relevant to glowing segments, assuming some segments may not be glowing.
Displaying the numbers is done using seven segment display. It is guaranteed that the sticks currently displaying are working fine..
Input : 78 Output :5 Input :05 Output :8
Example 1: 7 can be replaced by 5 different numbers 9, 3, 8, 0 and 7(if none of the segment is broken) and 8 can be replaced by only 1 number i.e 8 itself(if none of the segment is broken), therefore the answer is 5*1=5.
Example 2: 0 can be replaced by 2 numbers, 8 and 0, while 5 can be replaced by 4 different numbers. So, answer is 4*2=8.
Calculate for every number from 0–9 what all digits are possible by adding orremoving exactly one rod from the display. Store this in an array and the answer will be product of the array value of both the digits of the input.
Below is the implementation of above approach:
- Maximum number of consecutive 1's in binary representation of all the array elements
- Maximum Bitwise OR pair from a range
- Check whether all the substrings have number of vowels atleast as that of consonants
- Best Way To Start With Competitive Programming - GeeksforGeeks CP Live Course
- Find closest integer with the same weight
- Minimum number of coins that can generate all the values in the given range
- Check whether the given decoded string is divisible by 6
- Maximum count of elements divisible on the left for any element
- Count of odd and even sum pairs in an array
- Maximum sum subarray of even length
- Check whether a node is leaf node or not for multiple queries
- Number of ways to distribute N Paper Set among M students
- What Are The Best Resources For Competitive Programming?
- Check if a number is Euler Pseudoprime
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.
Improved By : manishshaw1