Can someone please help, what am I doing wrong ? Or on what test cases my solution is failing. It passes 12/19 test cases.
Here is the atcoder question link : LINK
Here is my solution:
Code
Thanks in advance :)
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
Help needed in DP problem
Can someone please help, what am I doing wrong ? Or on what test cases my solution is failing. It passes 12/19 test cases.
Here is the atcoder question link : LINK
Here is my solution:
ll dp[110][110];
ll mod=998244353;
ll solve(ll i,vector<ll>& 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);
}
Thanks in advance :)
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | 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 | hemant_thakur | 2022-08-01 09:28:47 | 949 | Initial revision (saved to drafts) |
Name |
---|