FLOUR PACK PROBLEM

 Write a method called canPack with three parameters of type int named bingCount, smallCount, goal.
The parameter bigCount represents the count of a big bag of flour bags(5Kg) each.
The parameter smallCount represents the count of a small bag of flour bags(1Kg) each.
The parameter goal represents the goal amount of kilos of flour needed to assemble a package.
therefore the sum of kilos bigCount and smallCount must be equal to the value of the goal. the method should true if it is possible to make a package with goal kilos of flour.
If the sum is greater than the goal, ensure that only full bangs are used toward the goal amount.
if any negative parameter is used return negative.
package com.cnc;

public class Main {

    public static void main(String[] args) {
        System.out.println(canPack(2,0,6));
        System.out.println(canPack(1,0,5));
    }
    public static boolean canPack(int bigCount, int smallCount, int goal){
        if (bigCount * 5 + smallCount >= goal){

            for (int i = 0; i <= bigCount; i++){
                for (int j = 0; j <= smallCount; j++){
                    if (i * 5 + j == goal){
                        return true;
                    }
                }
            }

        }

        return false;
    }
} 

Popular posts from this blog

NUMBER PALINDROME CHALLENGE

  package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( isPalindrome ( 101 )); } public static boolean isPalindrome ( int number) { int reverse = 0 ; int temporaryNumber =number; while (number!= 0 ){ reverse = reverse* 10 + number% 10 ; number = number/ 10 ; } if (reverse== temporaryNumber ) return true ; else return false ; } }
Read more

ENCAPSULATION CHALLENGE

package com.cnc ; public class Main { public static void main ( String [] args) { Printer printer = new Printer( 50 , true ); System . out .println( "Initial Page count is " + printer .getNumberOfPages()); int pagesPrinted = printer .getNumberOfPages( 4 ); } } package com.cnc ; public class Printer { private int tonerLevel = 100 ; private int numberOfPages ; private boolean isDuplex ; public Printer ( int tonerLevel, boolean isDuplex) { if (tonerLevel>=- 1 && tonerLevel<= 100 ) { this . tonerLevel = tonerLevel; } else { this . tonerLevel =- 1 ; } this . isDuplex = isDuplex; this . numberOfPages = 0 ; } public int addToner ( int tonerAmount){ if (tonerAmount> 0 && tonerAmount<= 100 ){ if ( this . tonerLevel +tonerAmount > 100 ){ return - 1 ; } this . tonerLevel += tonerAmount
Read more

LARGEST PRIME FACTOR OF A NUMBER

package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( getLargestPrime ( 20 )); System . out .println( getLargestPrime ( 7 )); } public static int getLargestPrime ( int number){ int i,stored=number; if (number<= 0 ) return - 1 ; else if ( isPrime (number)){ number=stored; } else { for ( i = 2 ; i < number; i++){ if (number%i== 0 ){ stored=i; } } } return stored; } public static boolean isPrime ( int n){ for ( int j = 2 ; j <n; j ++){ if (n% j == 0 ) return false ; else return true ; } return false ; } } ☑ Here i created a new method isTrue. if the number is prime then the number will return the same as output. but if it is not a prime then it will return the largest number excluding itself.
Read more