Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

test pull request #41

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions pull_request_test/jjunny/packing_knapsack/generator_test_script.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
#!/bin/python
import random

test_script = open("test.sh","w")

test_script.write("#!/bin/bash\n")
test_script.write("echo -e \"")

nr = random.randrange(1,1000)
w = random.randrange(1,10000)

test_script.write(str(nr)+" "+str(w)+"\\n\\\n")


for i in range(1,nr-1):
j_p = random.randrange(1,w)
j_w = random.randrange(1,w)
test_script.write(str(j_p)+" "+str(j_w)+"\\n\\\n")

j_p = random.randrange(1,w)
j_w = random.randrange(1,w)
test_script.write(str(j_p)+" "+str(j_w)+"\\n\" | ./a.out")
Binary file not shown.
115 changes: 115 additions & 0 deletions pull_request_test/jjunny/packing_knapsack/packing_knapsack.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,115 @@
/*
* Packing knapsack question
*
* Copyright (C) 2016, Taeung Song <[email protected]>
*
*/
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>

#define MAX_INPUT 16

struct knapsack {
unsigned int maxprice;
} *knapsack_list;

struct jewelry {
unsigned int wgt;
unsigned int price;
};

unsigned int limited_wgt;

unsigned int get_cond_maxprice(int wgt, struct jewelry *jewelry)
{
/* Get maximum price based on a specific weight
* following a specific jewelry.
*/
int i;
int rest_wgt = wgt - jewelry->wgt;
int price = jewelry->price + knapsack_list[rest_wgt].maxprice;

return knapsack_list[wgt].maxprice < price ?
price : knapsack_list[wgt].maxprice;
}

void pack_knapsack(struct jewelry *jewelry)
{
/* Case by case pack knapsack following maximum
* price per limited weight.
*/
int wgt;

if (limited_wgt < jewelry->wgt)
return;

for (wgt = 0; wgt <= limited_wgt; wgt++) {
if (jewelry->wgt <= wgt) {
unsigned int maxprice = get_cond_maxprice(wgt, jewelry);

if (knapsack_list[wgt].maxprice < maxprice)
knapsack_list[wgt].maxprice = maxprice;
}
}
}

bool get_values_from(char *input, unsigned int *val1, unsigned int *val2)
{
char *arg;
char *ptr = strdup(input);

if (!ptr) {
printf("%s: strdup failed\n", __func__);
exit(1);
}

arg = strsep(&ptr, " ");
*val1 = atoi(arg);
if (ptr == NULL) {
printf("Error: Need a whitespace\n");
return false;
}

*val2 = atoi(ptr);

return true;
}

int main(int argc, const char **argv)
{
int i;
struct jewelry *jewels;
char input[MAX_INPUT];
unsigned int nr_jewels;

fgets(input, sizeof(input), stdin);
if (get_values_from(input, &nr_jewels, &limited_wgt) == false)
return -1;

jewels = malloc(sizeof(struct jewelry) * nr_jewels);
for (i = 0; i < nr_jewels; i++) {
bool ret;

fgets(input, sizeof(input), stdin);
ret = get_values_from(input, &jewels[i].wgt,
&jewels[i].price);
if (ret == false)
return -1;
}

/* from 0 to last limited weight */
knapsack_list = malloc(sizeof(struct knapsack) * (limited_wgt + 1));

for (i = 0; i <= limited_wgt; i++)
knapsack_list[i].maxprice = 0;

for (i = 0; i < nr_jewels; i++)
pack_knapsack(&jewels[i]);

printf("%d\n", knapsack_list[limited_wgt].maxprice);
free(jewels);
free(knapsack_list);
return 0;
}
7 changes: 7 additions & 0 deletions pull_request_test/jjunny/packing_knapsack/test.sh
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
#!/bin/bash

echo -e "4 14\n\
2 40\n\
5 110\n\
10 200\n\
3 50\n" | ./$1