We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Tower Breakers, Revisited!
Tower Breakers, Revisited!
Sort by
recency
|
40 Discussions
|
Please Login in order to post a comment
JS:
Here is Tower Breakers, Revisited problem solution in Python Java C++ and c programming - https://programs.programmingoneonone.com/2021/07/hackerrank-tower-breakers-revisited-problem-solution.html
Just another Python solution ...
Another approach is to calculate for each number 1 to MAX, the corresponding gurdy number.
My code is not giving ans in time as it is saying "time limit exceeded".What chnages should i do??
import java.util.*; public class tower_breakers { public static void main(String args[]) { Scanner in=new Scanner(System.in); int t,n,i,j,c=0,k,d=0,l;
}