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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 167 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
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 :)
Name |
---|