I've added a relatively simple number theory problem to the software problems, since it (per common knowledge, at least) involves iteration and/or recursion to solve. That is, given two integers, produce the Greatest Common Divisor.
The training cases are randomized in each run, but consist of
a small number of "identity" cases (GCD(x,x) = x)
a number of nontrivial cases (where the GCD is not 1 or either arg) with arguments of about 10000
a number of nontrivial cases with bigger arguments
a number of cases with coprime arguments (GCD(a,b)=1)
I really don't have much to say about the argmap settings; I still honestly don't know what a lot of them do, or what values they should take, but the first run I did once I'd cleaned up the problem specification did solve the training cases.
I've added a relatively simple number theory problem to the software problems, since it (per common knowledge, at least) involves iteration and/or recursion to solve. That is, given two integers, produce the Greatest Common Divisor.
The training cases are randomized in each run, but consist of
GCD(x,x) = x)GCD(a,b)=1)I really don't have much to say about the
argmapsettings; I still honestly don't know what a lot of them do, or what values they should take, but the first run I did once I'd cleaned up the problem specification did solve the training cases.