【题解】codeforces1058C[Codeforces Round #512 Div.2 C]C.Vasya and Golden Ticket 区间DP

Description

Recently Vasya found a golden ticket — a sequence which consists of $n$ digits $\overline{a_1{a}_2\cdots a_n}$. Vasya considers a ticket to be lucky if it can be divided into two or more non-intersecting segments with equal sums. For example, ticket $350178$ is lucky since it can be divided into three segments $350$, $17$ and $8$: $3+5+0=1+7=8$. Note that each digit of sequence should belong to exactly one segment.

Help Vasya! Tell him if the golden ticket he found is lucky or not.

Input

The first line contains one integer $n$ ($2\le n\le 100$) — the number of digits in the ticket.

The second line contains $n$ digits $\overline{a_1{a}_2\cdots a_n}$ ($0\le a_i\le 9$) — the golden ticket. Digits are printed without spaces.

Output

If the golden ticket is lucky then print “YES”, otherwise print “NO” (both case insensitive).

Examples

Input

5
73452

Output

YES

Input

4
1248

Output

NO

Note

In the first example the ticket can be divided into $7$, $34$ and $52$: $7=3+4=5+2$.

In the second example it is impossible to divide ticket into segments with equal sum.

---

区间DP。设 $F[pos]$ 表示 $pos$ 位是否可以作为一段的结尾。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n,sum[110];
bool f[110];
char ch;
int main()
{
    std::ios::sync_with_stdio(false);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>ch,sum[i]=sum[i-1]+ch-'0';
    if(sum[n]==0)return puts("YES"),0;
	for(int i=0;i<sum[n];i++)
    {
    	memset(f,false,sizeof(f));
    	f[0]=true;
    	for(int t=1;t<=n;t++)
    	    for(int h=t;h;h--)
    	        if(f[h-1]&&sum[t]-sum[h-1]==i)
    	            f[t]=true;
    	if(f[n]==true)return puts("YES"),0;
	}
	return puts("NO"),0;
}

总结

原本想暴力的，结果错了……刚好写写DP