x
×


Shortest path from 1 to n
Submissions: 16466   Accuracy:

43.46%

  Difficulty: Basic   Marks: 1
Show Topic Tags      
Company Tags Accolite  Cisco  Morgan Stanley  Samsung  Synopsys 

Consider a directed graph whose vertices are numbered from 1 to n. There is an edge from a vertex i to a vertex j iff either j = i + 1 or j = 3i. The task is to find the minimum number of edges in a path in G from vertex 1 to vertex n.

Input: 
The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows.

Each test case contains a value of n. 

Output: 
Print the number of edges in the shortest path from 1 to n.

Constraints:
1<=T<=30
1<=n <=1000

Example:
Input:
2
9
4

Output:
2
2

 

** For More Input/Output Examples Use 'Expected Output' option **

Author: kartik
Editorial


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.