Allow the use of cookies to log in to the MQL5.com website.
Please enable the necessary setting in your browser, otherwise you will not be able to log in.
You are signed in. Two-factor authentication has been disabled. Set it up again and scan a new QR code, or continue with two-factor authentication disabled.
your example is not a combination but a permutation without repetition
And my example is a conjunction without repetition.
Oh, so that's what it's supposed to be?
0
1
01
11
001
101
011
...
Then the code won't be much more complicated for you, but you definitely don't need that many loops.
Oh, so that was the plan?
Yes
I had to generate file names in the tester, each file is a strategy parameter
and by generating combinations without repetitions all combinations of TS are combined, on the last page of the topic is the code that does this
and your problem is easy to google "permutations without repetitions recursion s++"
and your problem is easily googled "permutations without recursion recursion C++".
I googled it, but mostly not universal solutions come up.
But it's much more interesting and informative to do and figure it out yourself).
can I have the code?
It's simple:
It's simple:
Cool, thanks! I'll have a look.