uva 10465 Homer Simpson

完全背包问题，但是题意有点奇怪

#include <stdio.h>#include <stdlib.h>int a, b, bag_size;struct dp_node{int a_num;int b_num;};void func(){struct dp_node *dp;int i, temp;bool a_full, b_full;dp = (struct dp_node*)malloc(sizeof(struct dp_node)*(bag_size+1));dp[0].a_num = dp[0].b_num = 0;for(i=1; i<=bag_size; i++){dp[i].a_num = dp[i].b_num = -1;if(i>=a && dp[i-a].a_num!=-1){dp[i] = dp[i-a];dp[i].a_num++;}if(i>=b && dp[i-b].a_num!=-1){if(dp[i].a_num == -1){dp[i] = dp[i-b];dp[i].b_num++;}else{temp = dp[i-b].a_num + dp[i-b].b_num + 1;if(temp > dp[i].a_num+dp[i].b_num){dp[i] = dp[i-b];dp[i].b_num++;}}}}for(i=bag_size; i>=0; i--){if(dp[i].a_num != -1)break;}if(bag_size == i){printf("%d\n", dp[i].a_num + dp[i].b_num);}else{printf("%d %d\n", dp[i].a_num + dp[i].b_num, bag_size-i);}}int main(void){//freopen("input.dat", "r", stdin);while(scanf("%d %d %d", &a, &b, &bag_size) != EOF){func();}return 0;}