-1
$\begingroup$

I'm looking for an algorithm of sorts for my problem. I have 10 buttons, Alpha = 1, Bravo = 2, Charlie = 4, Delta = 8, Echo = 16, Fox = 32, Golf = 64, Hotel = 128, India = 256, Juliet = 512, Each button can only be pressed once at the same time, so for example; If I pressed Alpha, Bravo, Charlie and Delta at the same time, I would get 15. No number will ever be a duplicate either and should only go up to about 1023 possible combinations. Any ideas?

$\endgroup$

closed as unclear what you're asking by vonbrand, Discrete lizard Aug 11 at 21:18

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.