1030C.md (1306B)
1 Source: https://codeforces.com/problemset/problem/1030/C 2 3 C. Vasya and Golden Ticket 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Recently Vasya found a golden ticket — a sequence which consists of $n$ digits $a_1a_2\dots 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. 22 23 Help Vasya! Tell him if the golden ticket he found is lucky or not. 24 25 Input 26 27 The first line contains one integer $n$ ($2 \le n \le 100$) — the number of digits in the ticket. 28 29 The second line contains $n$ digits $a_1 a_2 \dots a_n$ ($0 \le a_i \le 9$) — the golden ticket. Digits are printed without spaces. 30 31 Output 32 33 If the golden ticket is lucky then print "YES", otherwise print "NO" (both case insensitive). 34 35 Examples 36 37 Input 38 39 ``` 40 5 41 73452 42 ``` 43 44 Output 45 46 ``` 47 YES 48 ``` 49 50 Input 51 52 ``` 53 4 54 1248 55 ``` 56 57 Output 58 59 ``` 60 NO 61 ``` 62 63 Note 64 65 In the first example the ticket can be divided into $7$, $34$ and $52$: $7=3+4=5+2$. 66 67 In the second example it is impossible to divide ticket into segments with equal sum.