好像不能让娃跟AI学写程序啊

Here is an OCaml program that computes the 5th biggest prime number less than 1000:

Copy code

(* Helper function to check if a number is prime *)

let is_prime n =
    let rec is_prime_rec i =
        i * i > n || (n mod i <> 0 && is_prime_rec (i+1))
    in n < 2 || is_prime_rec 2

(* Find the 5th biggest prime number less than 1000 *)
let rec find_fifth_biggest_prime count n =
    if count = 5 then n
    else if is_prime n then find_fifth_biggest_prime (count+1) (n-1)
    else find_fifth_biggest_prime count (n-1)

let fifth_biggest_prime = find_fifth_biggest_prime 0 999

(* Print the result *)
print_int fifth_biggest_prime;
print_newline ()

所有跟帖： 

• 现在就把目标定为JS啦 -xiaociwei- ♀ (0 bytes) () 12/19/2022 postreply 13:11:00

• 倒也没有。。。 -古代的事物- ♂ (50 bytes) () 12/19/2022 postreply 13:14:11