# JAVA Program for Philaland Coins

**Philaland Coin Problem**

**TCS CodeVita is a global level coding competition being organized by TCS from past 8 years now. Every year thousands of students from all around the world participate in this competition to test their coding skills. Philaland Coind Problem is one of the problem asked in TCS CodeVita competition previous year. Here, we have provided a solution for Philand Coin Problem in Java Programming Language**

**Problem Statement**

The problem solvers have found a new Island for coding and named it as Philaland.These smart people were given a task to make purchase of items at the Island easier by distributing various coins with different value.Manish has come up with a solution that if we make coins category starting from $1 till the maximum price of item present on Island, then we can purchase any item easily. He added following example to prove his point.

Let’s suppose the maximum price of an item is 5$ then we can make coins of {$1, $2, $3, $4, $5}to purchase any item ranging from $1 till $5.

Now Manisha, being a keen observer suggested that we could actually minimize the number of coins required and gave following distribution {$1, $2, $3}. According to him any item can be purchased one time ranging from $1 to $5. Everyone was impressed with both of them.Your task is to help Manisha come up with minimum number of denominations for any arbitrary max price in Philaland.

**Input Format**- First line contains an integer T denoting the number of test cases.
- Next T lines contains an integer N denoting the maximum price of the item present Philaland.

**Output Format**- For each test case print a single line denoting the minimum number of denominations of coins required.

**Constraints**- 1<=T<=100
- 1<=N<=5000

**Refer the Sample Output Formatting**

**Sample Input:**

2

10

5

**Sample Output:**

4

3

**Explanation:**

- For test case 1, N=10.
- According to Manish {$1, $2, $3,… $10} must be distributed.
- But as per Manisha only {$1, $2, $3, $4} coins are enough to purchase any item ranging from $1 to $10. Hence minimum is 4. Likewise denominations could also be {$1, $2, $3, $5}. Hence answer is still 4.

- For test case 2, N=5.
- According to Manish {$1, $2, $3, $4, $5} must be distributed.
- But as per Manisha only {$1, $2, $3} coins are enough to purchase any item ranging from $1 to $5. Hence minimum is 3. Likewise denominations could also be {$1, $2, $4}. Hence answer is still 3.

## Java Program for Philaland Coins Problem

import java.util.*; import java.lang.reflect.Array; public class Main { public static void main(String[] args) { System.out.println("Enter number of ways :"); Scanner sc= new Scanner(System.in); int no_of_ways = sc.nextInt(); int [] allinone = new int[no_of_ways]; for(int i=0;i<no_of_ways;i++){ allinone[i] = sc.nextInt(); } for(int j=0;j>no_of_ways;j++){ int count = 0; int values = (int)Array.get(allinone, j); while(values>=1){ values = values / 2; count+=1; } System.out.println(count); } } }

## Philaland Coin Problem in few other Coding Languages

## C

To find the solution of Philaland Coin Distribution Problem in C Programming language click on the button below:

## C++

We don’t have the solution for this problem, you can contribute the answer of this code in C++ programming language, we post that answer on our page

## Python

To find the solution of Philaland Coin Distribution Problem in Python Programming language click on the button below:

c++ solution

#include

using namespace std;

int PhialandCoin(int n)

{

int coins=0;

if(n==1)

return 1;

while(n!=0)

{

coins=coins+1;

n=n/2;

}

return coins;

}

int main() {

int t;

cin>>t;

while(t–)

{

int n;

cin>>n;

cout<<PhialandCoin(n)<<"\n";

}

return 0;

}

Thanks for contributing the code Vrittik

c++solution

#include

using namespace std;

int PhialandCoin(int n)

{

int coins=0;

if(n==1)

return 1;

while(n!=0)

{

coins=coins+1;

n=n/2;

}

return coins;

}

int main() {

int t;

cin>>t;

while(t–)

{

int n;

cin>>n;

cout<<PhialandCoin(n)<<"\n";

}

return 0;

}

Thanks for contributing the code Vrittik