permutations without recursion????I'm a bit confused. Your code does not compute a permutation but only all subsets of a string, right...
Creating my own programming languageOf course. Asking the question means not being able to do it.
Why can't this statement be compiled?Just for the problem: do you intend to count something within a century, each second separately?
Is it possible to convert CString to BinaryUnder Unix, use strtol() with a base of 2.
Binary was not built with debug informationtry to run on console, there may be some error output
This user does not accept Private Messages