thanks a lot!

while ((cur_char = program[i]) != 'o')

infinite loop if there is no 'o'

no real random tests, integer overflow, input char * not const-qualified. all fixed, but I could not modify the prototype without invalidating previous solutions, so there is no way for the user to report his array's length

several things wrong here: if there are no 'o' in the input, you derefence malloc(0), this is UB; you also assume that malloc() will return zeroed memory, this is not always true

you mistakenly wrote result++; while you probably meant num++;. result is an Array and using the ++ operator on it converts it to a Number, and Numbers do not have a push() method.

fixed

fixed

added random tests in C that will never generate an int overflow

Corrected with a fork and approved

I know how to code but couldn't understand what's the relation with dead fish. Can anyone explain that?

Your algorithm for counting the divisors is very inefficient.

I've posted my code just now. I've tried to write a function to get divisors already.And I also tried for loop.It's just no use.I have no idea now.