Coin change problem by DP

#include<iostream>
using namespace std;

int Count(int arr[],int n,int value){
  int total[n+1][value+1];
  for(int i=0;i<=n;i++)
    total[i][0]=1;
  for(int i=0;i<=value;i++)
    total[0][i]=0;
  for(int i=1;i<=n;i++){
    for(int j=1;j<=value;j++){
           if(arr[i-1]<=j)
             total[i][j]=total[i][j-arr[i-1]]+total[i-1][j];
           else
            total[i][j]=total[i-1][j];
      }
    }
    return total[n][value];
  }

int main(){
  int arr[] = {2,5,3,6};
  int m = sizeof(arr)/sizeof(arr[0]);
  cout<< Count(arr, m, 10);
  return 0;
  }