For this Question: You are given an array A of size N, with all values as non-negative integers. Bodega asked you whether it is possible to partition the array into exactly K non-empty subarrays such that the sum of values of each subarray is equal. If it is possible print "Yes", otherwise print "No".

Note:
Every element of the array should belong to exactly one subarray in the partition.The first line consists of two space-separated integers N and K respectively.
The second line consists of N space-separated integers – A<sub>1</sub>, A<sub>2</sub>, ... A<sub>N</sub>.

<b>Constraints:</b>
1 &le; N &le; 10<sup>5</sup>
1 &le; K &le; 20
0 &le; A<sub>i</sub> &le; 10<sup>6</sup>
There exists at least one non-zero element in array A.Print a single word "Yes" if the array can be partitioned into K equal sum parts, otherwise print "No".

Note:
The quotation marks are only for clarity, you should not print them in output.
The output is case-sensitive.Sample Input 1:
5 2
2 2 1 2 2
Sample Output 1:
No

Sample Input 2:
10 3
3 0 1 2 0 0 6 0 1 5
Sample Output 2:
Yes
Explanation:
The array can be partitioned as {3, 0, 1, 2, 0, 0}, {6}, {0, 1, 5}., I have written this Solution Code: N,K=map(int,input().split())
S=0
a=input().split()
for i in a:
    S+=int(i)
if S%K!=0:
    print('No')
else:
    su=0
    count=0
    asd=S/K
    for i in range(N):
        su+=int(a[i])
        if su==asd:
            count+=1
            su=0
    if count==K:
        print('Yes')
    else:
        print('No'), In this Programming Language: Python, Now tell me if this Code is compilable or not?