backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-13 17:29:42 +08:00
Code Issues Projects Releases Wiki Activity

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
Dynamic Programming/Egg-Dropping-Puzzle.cpp
View File

@@ -6,40 +6,47 @@
#include <climits>
using namespace std;
int eggDrop(int n, int k) {
int eggFloor[n+1][k+1];
int eggDrop(int n, int k)
{
int eggFloor[n + 1][k + 1];
int result;
for(int i=1; i<=n; i++) {
for (int i = 1; i <= n; i++)
{
eggFloor[i][1] = 1; //n eggs..1 Floor
eggFloor[i][0] = 0; //n eggs..0 Floor
}
// Only one egg available
for(int j=1; j<=k ; j++) {
for (int j = 1; j <= k; j++)
{
eggFloor[1][j] = j;
}
for(int i=2; i<=n; i++) {
for(int j=2; j<=k; j++) {
for (int i = 2; i <= n; i++)
{
for (int j = 2; j <= k; j++)
{
eggFloor[i][j] = INT_MAX;
for(int x=1; x<=j; x++) {
for (int x = 1; x <= j; x++)
{
// 1+max(eggBreak[one less egg, lower floors],
// eggDoesntBreak[same # of eggs, upper floors]);
result = 1 + max(eggFloor[i-1][x-1], eggFloor[i][j-x]);
if(result < eggFloor[i][j])
result = 1 + max(eggFloor[i - 1][x - 1], eggFloor[i][j - x]);
if (result < eggFloor[i][j])
eggFloor[i][j] = result;
}
}
}
return eggFloor[n][k];
}
int main() {
int main()
{
int n, k;
cout << "Enter number of eggs and floors: ";
cin>>n>>k;
cin >> n >> k;
cout << "Minimum number of trials in worst case: " << eggDrop(n, k) << endl;
return 0;
}