include

include

include

include

include

using namespace std;

const int32_t N = 101; int32_t A[N]; int32_t n;

bool Ok(int32_t k) { map M; int32_t mask = 0; for (int32_t i = 30; i >= k; i--) { mask |= (1< vec; for (map::iterator it = M.begin(); it != M.end(); ++it) { vec.push_back(it->second); } sort(vec.begin(), vec.end()); if (vec.size() == 1) return false; int32_t s = vec[0]; for (int32_t i = 1; i < vec.size(); i++) { if (s < vec[i]) return false; s += vec[i]; } return true; } int32_t main() { scanf("%d", &n); for (int32_t i = 0; i < n; i++) { scanf("%d", &A[i]); } for (int32_t k = 30; k >= 0; k--) { if (Ok(k)) { printf("%d\n", k); break; } } return 0; }

who can i find optimal permutation

Solution descibed here

Honetsly I was unable to resolve this without StackOverflow help

Is there anyway to solve this without finding all the permutations of the array, because when the number of elements increase it leads to timeout.

I am attemping to complete one of the Erlang sample test exercises. When I try to run my code, I get an odd Erlang error:

{"init terminating in do_boot",{badarg,[{array,size,1,[{file,"array.erl"},{line,324}]},{solution,main,0,[{file,"/run-CIU10ESE6BCJICS6R3yc/solution.erl"},{line,47}]},{init,start_em,1,[]},{init,do_boot,3,[]}]}}

This looks like an Erlang configuration problem to me. I'm pretty confident that my code is correct since it runs as expected in my local environment.

The exercise that I am attempting is "Odd Numbers" and my code is:

even(X) when X >= 0 -> (X band 1) == 0.
odd(X) when X > 0 -> not even(X).

oddNumbers(L, L) ->
    Odd = odd(L),
    if
        Odd ->
            [L];
        true ->
            []
    end;   
oddNumbers(L, R) -> 
    Odd = odd(L),
    if
        Odd ->
            [L | oddNumbers(L + 1, R)];
        true -> 
            oddNumbers(L + 1, R)
    end.

Can someone check to see what might be going wrong?

Thanks