谷歌笔试题-背包问题

#include <stdlib.h>
#define N 1000005
long long c
;
int change[] ={1,2,5,10,50,100};

long long  findChange(int sum, int* change,int n)
{
int i = 0, j = 0;
c[0] = 1;
for(; i < n; i++)
{
for(j = change[i]; j <= sum; j++)
{
c[j] = c[j - change[i]] + c[j];
}
}
return c[sum];
}

int main()
{
int result = findChange(1000000,change,6);
printf("total kinds: %lld",result);
getchar();
}