Question

rewrite the following code of program using for loop

x=10

y=100

if x==y:

print(x)

elify>x:

print(y)

while x<10:

print(x)

X+=1​

Answer 1

Answer:

subsets of osashutosh is a very mischievous student. his mathematics teacher wants to teach him a lesson so, he gave ashutosh an array of positive integers ar[a1, and where ai> 0. prímesum is an integer which isequal to sum of all the prime factors of each element in arr, modulus (10^6). ashutosh's job is to find no of ways in which a set of primesum' number of os can be divided into k subsets modulus(10^9+7).ashutosh is a little nervous, can you him get out of this trouble ? note: a subset can be emptyinput: the first line indicates the number of subsets, kthe next line has a single integer n denoting the length of array. next n lines contain the integers in the array. input format for custom testing: 2 -> number of subsets, k3 --> length of the array3 --> length of the array for hackerrank representation of integer array followed by elements of the array1output: an integer representing the number of ways in which a set of primesum number of os can be divided into k subsets mod (10^9+7).constraints: o< al< =10^61 cun< =10451 < =k< =100