BRILLIANT BINGO

 BRILLIANT BINGO



I/P:

7892


O/P:

5


EXPLANATION :

Check this video to understand better:

Given a number in each round of the game the players have to multiply their number

with the round number.

 The game stops when a player gets all the numbers from 0 to 9 and its a

brilliant game bingo.

7892*1 => 7 8 9 2=7892*2=1 5 7 8 4=7892*3= 2 3 6 7 6=7892*4= 3 1 5 6 8=7892*5= 3 9 4 6 0

0 1 2 3 4 5 6 7 8 9

O/P:

5


PROGRAM:

import java.util.*;
public class BrilliantBingo {
    
    public static void Bingo(int iNum)
    {
        TreeSet<Integer> ts=new TreeSet<>();
        int i=1,r=0;
        while(ts.size()!=10){
          
          int dup=iNum*i;
          int t=0;
          
          while(dup>0)
          {
                t=dup%10;
                ts.add(t);
                dup/=10;

          }
        
          r++;
          i++;
        }
        System.out.println(r);
          

    }
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int iNum=sc.nextInt();
        Bingo(iNum);
    }
    
}




Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND FACTORIAL OF A NUMBER USING RECURSION

 PROGRAM TO FIND FACTORIAL OF A NUMBER  USING RECURSION  I/P: 3 O/P: 6 SOLUTION: package   N umbers ; import   java . util .*; public   class   Factorial  {      static   int   factorial ( int   n ) {          return  ( n  >  1 )  ?   n  *  factorial ( n - 1 )  :   1 ;        }         public   static   void   main ( String []  args ) {              Scanner   sc = new   Scanner ( System . in );             int   n  =  sc . nextInt ();                          int   result  ...
Read more

PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY

  PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY I/P: 5 1 0 2 0 0 O/P: 3 This program explains how many zeros present in the zero PROGRAM: import   java . util .*; public   class   ZeroCount  {      public   static   void   main ( String   args [])     {          Scanner   sc = new   Scanner ( System . in );          int   iNum = sc . nextInt ();          int   arr []= new   int [ iNum ];          for ( int   i = 0 ; i < iNum ; i ++)         {              arr [ i ]= sc . nextInt ();         }          int   count = 0 ; ...
Read more

TELEPHONE BOOK USING HASHMAP

  Sample Input 3 sam 99912222 tom 11122222 harry 12299933 sam edward harry Sample Output sam=99912222 Not found harry=12299933 Explanation We add the following    (Key,Value)  pairs to our map so it looks like this: We then process each query and print  key=value  if the queried   is found in the map; otherwise, we print  Not found . Query 0:   sam Sam is one of the keys in our dictionary, so we print  sam=99912222 . Query 1:   edward Edward is not one of the keys in our dictionary, so we print  Not found . Query 2:   harry Harry is one of the keys in our dictionary, so we print  harry=12299933 . SOLUTION: package   H acker R ank_problems . practice_problems ; import   java . util .*; import   java . io .*; public   class   TelephoneBook {      public   static   void   main ( String  [] argh ){          Scanne...
Read more