Magic pocket knapsack problem dynamic programming dp

#include<stdio.h>

int dp[205],sum[405];

int main(){
	int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf(" %d",&dp[i]);
    sum[0]=1;
    for(int i=0;i<n;i++)
        for(int j=400;j>=dp[i];j--){
            sum[j]=(sum[j]+sum[j-dp[i]])%10000;
        }
    printf("%d",sum[400]);
    return 0;
}