Help needed in DP problem

Revision en1, by hemant_thakur, 2022-08-01 09:28:47

Could someone please help, what I am doing wrong ? Here is the atcoder question link : LINK Here is my solution: ~~~~~ ll dp[110][110]; ll mod=998244353; ll solve(ll i,vector& a,ll sum,ll chosen) { ll n=a.size(); if(i==n) { if(chosen==0) { return 0; } // debug(sum) if(sum%chosen==0) return 1; else return 0; } // cout<<1; if(dp[i][chosen]!=-1) return dp[i][chosen]%mod; return dp[i][chosen]=(solve(i+1,a,sum+a[i],chosen+1)%mod+solve(i+1,a,sum,chosen)%mod)%mod;

} void solve() {

ll n;
   cin>>n;
   vi a(n);
   rep(110)
   {
    for(ll j=0;j<110;j++)
        dp[i][j]=-1;
}

   rep(n)
   cin>>a[i];

  cout<< solve(0,a,0,0);

}~~~~~

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English hemant_thakur 2022-08-01 09:34:17 168 Tiny change: 'oiler>\n\n\n\n' -> 'oiler>\n\nThanks in advance :)\n\n\n\n' (published)
en1 English hemant_thakur 2022-08-01 09:28:47 949 Initial revision (saved to drafts)