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 :)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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 :)
Название |
---|