maxways

#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int coin[n];
for(int i=0;i<n;i++){
cin>>coin[i];
}
int t=12;
int m[n+1][t+1];
for(int i=0;i<=n;i++){
for (int j=0;j<=t;j++){
if(j==0) {m[i][j]=1;}
else if(i==0) {m[i][j]=0;}
else if(coin[i-1]>j) { m[i][j]=m[i-1][j];}
else {m[i][j]=m[i-1][j]+m[i][j-coin[i-1]];}
}
}
for(int i=0;i<=n;i++){
for (int j=0;j<=t;j++){
cout<<m[i][j]<<" ";
}
cout<<endl;
}
cout<<m[n][t]<<endl;
return 0;
}