Elementary school math problems, will you?

F (14, {2, 3, 5, 7, 11, 13}) =
MAX (
2 * F (12, {2, 3, 5, 7, 11, 13 }),
F (14, {3, 5, 7, 11, 13 }),

F (16, {3, 5, 7, 11, 13}) =
MAX (
3 * F (3, {2, 3, 5, 7, 11, 13 }),
F (16, {5, 7, 11, 13 }),

# Include <stdio. h> input (unsigned * main (& n); printf (, maxmul (n, set of prime numbers); u1> u2? (The set of prime numbers is empty. | n <(n = * maxmul _ (n-(n <) input (unsigned *

 prime_list ** P_LIST;

P_LIST pr_list = NULL ;

pr_list = build( n ); 

 prime_list ** build_( P_LIST * , P_LIST * add ( P_LIST * * my_malloc( P_LIST * my_malloc( P_LIST * ( ( * pp = malloc(  (* * pp) )) == add ( P_LIST * * ppp_e, unsigned ** * ppp_e ) -> prime =* * ppp_e ) -> next  =* ppp_e = & ( * * ppp_e ) -> ( n ==  || p == ( n % p -> prime ==  be_prime( n , p -> build_( P_LIST * pp_b , P_LIST *( num > ( be_prime( num , *pp_b ) ==&pp_e , num ) ; + =&head , &head ,  , n );     

 

Prime_list ** input (unsigned * build _ (P_LIST *, P_LIST * add (P_LIST ** my_malloc (P_LIST * main (= & n); pr_list = build (n ); printf (, maxmul (n, pr_list); (p! =-> U1> u2? (P = NULL | n <p-> (n = p-> prime * maxmul _ (n-p-> (n <my_malloc (P_LIST * (* pp = malloc (** pp ))) = add (P_LIST ** ppp_e, unsigned *** ppp_e)-> prime = ** ppp_e)-> next = * ppp_e = & (** ppp_e) -> (n = | p = (n % p-> prime = be_prime (n, p-> build _ (P_LIST * pp_ B, p_LIST * (num> (be_prime (num, * pp_ B) = & pp_e, num); + = & head, & head, n); input (unsigned *

 

<Stdio. h> prime_list ** input (* build (P_LIST *, add (P_LIST *, my_malloc (P_LIST * maxmul (maxmul _ (max (, 0 (p! =, P-> = p-> main (= & n); build (& pr_list, n); printf (, maxmul (n, pr_list); max (n1, n1> n2? Maxmul (n <maxmul _ (n <(n = (p = (n <p-> maxmul _ (n, p-> prime * maxmul _ (n-p-> (tmp = p )! = P-> my_malloc (P_LIST * (* p_p = malloc (** p_p) = add (P_LIST * p_p, &-> prime =-> next = ** p_p = (p! = (N % p-> prime = p-> build (P_LIST * p_p, (I =; I <= n; I ++ (be_prime (I, * p_p) = YES) input (*View Code