Given k distinct elements a1 ak element of n how many permu

Given k distinct elements a_1, ..., a_k element of [n], how many permutations of [n] have a_1, ..., a_k all in the same cycle? Given i, j element of [n] and 1 lessthanorequalto a, b lessthanorequalto n with a + b lessthanorequalto n, how many permutations of [n] have i and j in distinct cycles of length a and b respectively?

Solution

define _REENTRANT #include #include /* Function prototypes for thread routines */ void *sub_a(void *); void *sub_b(void *); void *sub_c(void *); void *sub_d(void *); void *sub_e(void *); void *sub_f(void *); thread_t thr_a, thr_b, thr_c; void main() { thread_t main_thr; main_thr = thr_self(); printf(\"Main thread = %d\ \", main_thr);