Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit 6e83b86

Browse filesBrowse files
authored
Merge pull request dubesar#123 from DemonDaddy22/patch-1
Create EggDropping.java
2 parents 10a1d87 + 15448d2 commit 6e83b86
Copy full SHA for 6e83b86

File tree

Expand file treeCollapse file tree

1 file changed

+37
-0
lines changed
Filter options
Expand file treeCollapse file tree

1 file changed

+37
-0
lines changed

‎Dynamic Programming/EggDropping.java

Copy file name to clipboard
+37Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
import java.lang.*;
2+
import java.io.*;
3+
4+
class Solution {
5+
public static void main (String[] args) throws IOException{
6+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
7+
int t = Integer.parseInt(br.readLine());
8+
while (t-->0){
9+
String[] s = br.readLine().split(" ");
10+
int n = Integer.parseInt(s[0]);
11+
int k = Integer.parseInt(s[1]);
12+
System.out.println(eggDropping(n, k));
13+
}
14+
}
15+
16+
static int eggDropping(int n, int k){
17+
int[][] table = new int[n+1][k+1];
18+
for (int i=1; i<=n; i++){
19+
table[i][1] = 1;
20+
}
21+
for (int i=1; i<=k; i++){
22+
table[1][i] = i;
23+
}
24+
int res = 0;
25+
for (int i=2; i<=n; i++){
26+
for (int j=2; j<=k; j++){
27+
table[i][j] = Integer.MAX_VALUE;
28+
for (int x=1; x<=j; x++){
29+
res = 1+Math.max(table[i][j-x], table[i-1][x-1]);
30+
if (res<table[i][j])
31+
table[i][j] = res;
32+
}
33+
}
34+
}
35+
return table[n][k];
36+
}
37+
}

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.