back ground

in my country we had a silly game as kids, called 7-BOOM! The rules are really simple. We counted 1,2,3... each time we had a number that one of his digit is 7 or it is a multiply of 7 we said "BOOM" instead of this number, otherwise we were out of the game! Lets create our version to this game!


we will play n-boom in the range [1,a].

input- An integer "n" that represent the "boom-number" and another integer "a" that represent our range. Let assume that n is a positive one-digit integer and that a is an integer such that a>1 and both inputs are valid inputs.

output - Number of booms in our game.


(~ represent boom)

    a     n             string                        output

    10    2       1,~,3,~,5,~,7,~,9,~                    5

    10    3       1,2,~,4,5,~,7,8,~,10                   3

    100   1       ~,~,~,~,~,~,~...~,~                    100

    32    2     1,~,3,~...19,~,~,~,~,~,~,~,~,~,~,~,31,~   21

This is a code-golf, so the fewest bytes code is the winner! Have fun :)

  • \$\begingroup\$ There is a little diffrent, that is "n" can change. But the "change" here is pretty minor one so I'm okay with the duplicate mark. \$\endgroup\$
    – Moshe9362
    Mar 10, 2017 at 22:03
  • 2
    \$\begingroup\$ Welcome to the site! And don't be put down by your challenge being a duplicate; it happens relatively often. For future challenges I encourage you to use the sandbox first \$\endgroup\$
    – Luis Mendo
    Mar 10, 2017 at 22:45


Browse other questions tagged or ask your own question.