Count without 3

Question

Background

When I was in elementary school, we used to play a game in math class that goes as follows.

All kids sit in a big circle and take turns counting, starting from 1.

However, the following numbers must be skipped while counting:

Numbers that are multiples of 3.
Numbers that have a 3 in its decimal representation.

The first 15 numbers the kids should say are

1 2 4 5 7 8 10 11 14 16 17 19 20 22 25

Whenever somebody gets a number wrong – says a number that isn't in the sequence or skips a number that is – he's removed from the circle. This goes on until there's only one kid left.

Task

You're bad at this game, so you decide to cheat. Write a program or a function that, given a number of the sequence, calculates the next number of the sequence.

You don't have to handle numbers that cannot be represented using your language's native numeric type, provided that your program works correctly up to input 251 and that your algorithm works for arbitrarily large inputs.

Input and output can use any convenient base.

Since you have to conceal your code, it must be as short as possible. In fact, this is code-golf, so the shortest code in bytes wins.

Test cases

It was always 7 that was skipped when I played it, but you'd say something else, instead, rather than going to the next number in line. — mbomb007, Commented Nov 3, 2016 at 13:51
@mbomb007: When I played it, you would not be removed from the circle. Instead, you would drink. But that wasn't in the elementary school. Anyway, getting over 80 was near impossible, especially after the first hour. — tomasz, Commented Nov 3, 2016 at 21:49
@mbomb007: That would depend on the proof of whatever you are drinking. — tomasz, Commented Nov 4, 2016 at 14:16

doubleunary · Accepted Answer · 2023-11-30 11:21:05Z

2

Google Sheets, 63 bytes

=+let(n,sequence(254),filter(n,n>A1,mod(n,3),iserr(find(3,n))))

Put the input in cell A1 and the formula in B1.

The filter() gets all matching values above the value in A1 and the unary plus + gets the first value from that list.

edited Nov 30, 2023 at 11:21

answered Nov 30, 2023 at 11:09

doubleunary

2,7131 gold badge2 silver badges12 bronze badges

Add a comment |

Annett Schwarze · Accepted Answer · 2023-12-03 15:22:18Z

2

Swift, 84 bytes

func f(_ n:Int)->Int{var n=n+1;while String(n).contains("3")||n%3==0{n+=1};return n}

answered Dec 3, 2023 at 15:22

Annett Schwarze

1112 bronze badges

\$\begingroup\$ Welcome to Code Golf, and nice first submission! \$\endgroup\$
– noodle person
Commented Dec 3, 2023 at 15:29

Add a comment |

Steadybox · Accepted Answer · 2016-11-03 18:34:36Z

1

C, 81 bytes

f(int n){int m;l:if(++n%3){for(m=n;m>0;m/=10)if(m%10==3)goto l;return n;}goto l;}

answered Nov 3, 2016 at 18:34

Steadybox

16.5k5 gold badges41 silver badges84 bronze badges

Add a comment |

Conor O'Brien · Accepted Answer · 2016-11-03 19:15:40Z

reticular, 30 bytes

in v
?v$>1+d3,qds:3@cQm*
;\$o

Try it online!

Explanation

1: initialization

in v

This converts the input to a number, then goes down (v)

2: loop

?v$>1+d3,qds:3@cQm*
   >                 go right!              [n]
    1+               add 1                  [n+1]
      d3,            duplicate and mod 3    [n+1, (n+1)%3]
         qd          reverse and duplicate  [(n+1)%3, n+1, n+1]
           s         cast to string         [(n+1)%3, n+1, `n+1`]
            :3@c     count numbers of "3"   [(n+1)%3, n+1, `n+1`.count(3)]
                Qm*  negate and rotate      [n+1, continue?]
?v                   terminate if continue
  $                  drop continue

3: final

;\$o
 \$o  drop and output
;     terminate

Neil · Accepted Answer · 2016-11-04 00:42:21Z

1

Batch, 93 bytes

@set/pn=
:l
@set/an+=1,r=n%%3
@if %r%==0 goto l
@if not "%n:3=%"=="%n%" goto l
@echo %n%

Takes input on STDIN.

answered Nov 4, 2016 at 0:42

Neil

177k12 gold badges74 silver badges281 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

CJam, 19 bytes

ri{)__3%!\`'3e=e|}g

ONLINE

Explanation:

ri{)__3%!\`'3e=e|}g
r                   Get token
 i                  Convert to integer
  {              }  Block
   )                 Increment
    _                Duplicate
     _               Duplicate
      3              Push 3
       %             Modulo
        !            NOT gate
         \           Swap
          `          String representation
           '3        Push '3'
             e=      Count occurrences
               e|    OR gate
                  g While popped ToS is true

If a less verbose explanation was asked, I would have done this:

ri{)__3%!\`'3e=e|}g
ri                  Get integer
  {              }  Block
   )                 Increment
    __               Triplicate
      3%!            Test non-divisibility with 3
         \           Swap
          `'3e=      Count occurrences of '3' in string repr
               e|    OR gate
                  g While popped ToS is true

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Pyth, 19 bytes

JhQW|!%J3/`J\3=hJ;J

Test suite

I am sure I can golf this... it's the same as my CJam answer.

Explanation:

JhQW|!%J3/`J\3=hJ;J
  Q                 Evaluated input
 h                  Increment
J                   Assign J to value
       J            Variable J
        3           Value 3
      %             Modulo
     !              Logical NOT
           J        Variable J
          `         String representation
            \3      Value "3"
         /          Count occurrences
    |               Logical OR
               h    Increment
                J   Variable J
              =     Apply function then assign
                 ;  End statement block
                  J Variable J

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 4, 2016 at 14:32

Erik the Outgolfer

40.6k5 gold badges45 silver badges122 bronze badges

\$\begingroup\$ I posted a way shorter solution. Nevertheless here is a tip for your approach: Don't use the variable J. You can increment Q. And if your doing it clever, you can inline the operation into the while condition: W|!%=hQ3/Q\3;Q`. \$\endgroup\$
– Jakube
Commented Nov 8, 2016 at 19:01
\$\begingroup\$ Sorry: W|!%=hQ3/`Q\3;Q \$\endgroup\$
– Jakube
Commented Nov 8, 2016 at 19:07
\$\begingroup\$ @Jakube The variable is not just incrementing but thanks. \$\endgroup\$
– Erik the Outgolfer
Commented Nov 9, 2016 at 11:44

Add a comment |

Carcigenicate · Accepted Answer · 2016-11-05 19:36:24Z

1

Clojure, 73 bytes

(fn c[n](let[m(inc n)](if(or(=(rem m 3)0)(some #(=\3 %)(str m)))(c m)m)))

Recursively loops while n is divisible by 3, or contains a 3 in its string representation. Although I'm using unoptimized recursion, it was able to handle 2999999 as an input, so it should be ok.

Ungolfed

(defn count-without-3 [n]
  (let [m (inc n)]
    (if (or (= (rem m 3) 0)
            (some #(= \3 %) (str m)))
      (count-without-3 m)
      m)))

edited Nov 5, 2016 at 19:36

answered Nov 5, 2016 at 16:46

Carcigenicate

3,5782 gold badges22 silver badges30 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Mathematica, 51 bytes

#+1//.t_/;t~Mod~3<1||!IntegerDigits@t~FreeQ~3:>t+1&

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 17, 2017 at 22:26

ZaMoC

24.9k2 gold badges30 silver badges81 bronze badges

Add a comment |

Oliver · Accepted Answer · 2019-03-08 02:20:29Z

1

JavaScript, 35 bytes

f=n=>++n%3&&!(n+"").match(3)?n:f(n)

Try it online!

edited Mar 8, 2019 at 2:20

answered Nov 3, 2016 at 20:23

Oliver

7,9022 gold badges18 silver badges38 bronze badges

4

\$\begingroup\$ I am not an expert in JavaScript but this doesn't look very golfed. It looks like you have a lot of whitespace that could be removed. You might want to check out the tips page for JavaScipt. \$\endgroup\$
– Wheat Wizard ♦
Commented Nov 3, 2016 at 20:29
\$\begingroup\$ Ah, sorry, First time on this stackexchange. I thought this was just a problem to solve. Didn't realize there were rules. I wasn't sure what "golfed" meant. \$\endgroup\$
– Oliver
Commented Nov 3, 2016 at 20:31
4

\$\begingroup\$ No need to apologize. All puzzles here have a "winning criterion", quite often, such as in this challenge, it is code golf. If you want more general puzzles look into the programming-puzzle tag. Welcome to PPCG I hope you have fun. \$\endgroup\$
– Wheat Wizard ♦
Commented Nov 3, 2016 at 20:36
\$\begingroup\$ "Golfed" means you try to make the program as small as possible. Then you compete against other users to get the shortest Javascript answer. I would read through this page and edit your post if you can come up with a shorter solution. \$\endgroup\$
– DJMcMayhem
Commented Nov 3, 2016 at 21:26

Add a comment |

G B · Accepted Answer · 2019-03-08 08:34:19Z

1

Ruby, 29 bytes

->n{0until"#{n+=n%3}"!~/3/;n}

Try it online!

answered Mar 8, 2019 at 8:34

G B

22.8k1 gold badge20 silver badges53 bronze badges

Add a comment |

recursive · Accepted Answer · 2019-03-18 18:09:12Z

1

Stax, 9 bytes

ú╜H▌»NWì╤

Run and debug it

Unpacked, ungolfed, and commented it looks like this.

w       repeat rest of the program while the produced value is true
  ^c    increment and copy value
  E3#   (a) count number of digits that are 3
  n     copy incremented value
  3%!   (b) is multiple of 3?
  +     sum of (a) + (b) values

Run and debug this one

answered Mar 18, 2019 at 18:09

recursive

10.4k20 silver badges36 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Forth (gforth), 81 bytes

: f begin 1+ >r i i 3 mod 1 r> begin 10 /mod >r 3 <> * r> ?dup 0= until * until ;

Try it online!

Explanation

Add 1
check if multiple of 3
check if contains a 3
if the result of step 3 or step 4 is true, repeat from step 1

Code Explanation

: f               \ start a new word definition
  begin           \ start an indefinite loop
    1+            \ add 1 to current number
    >r i i        \ put current number on return stack, then place on normal stack twice
    3 mod         \ check if number is multiple of 3
    1 r>          \ place a 1 on the stack, then move the current number to the normal stack
    begin         \ start another indefinite loop
      10 /mod     \ get quotient and remainder of dividing by 10
      >r          \ put quotient on return stack
      3 <>        \ check if remainder does not equal 3
      *           \ multiply by accumulator (cheaper version of "and") 
      r>          \ remove quotient from return stack
      ?dup 0=     \ if quotient does not equal 0, duplicate, else put -1 on stack
     until        \ end loop if top of stack does not equal 0
     *            \ multiply result of both checks (cheaper "and")
   until          \ end outer loop
 ;                \ end word definition

CG One Handed · Accepted Answer · 2022-04-26 15:34:46Z

1

Ruby, 39 bytes

f=->n{n+=1;(n%3<1||n.to_s=~/3/)?f[n]:n}

Try it online!

answered Apr 26, 2022 at 15:34

CG One Handed

3131 silver badge7 bronze badges

Add a comment |

MarcMush · Accepted Answer · 2022-05-04 14:48:03Z

1

Julia 1.0, 34 bytes

!n='3'∈"$(n+=1)"||n%3<1 ? !n : n

Try it online!

answered May 4, 2022 at 14:48

MarcMush

6,63513 silver badges17 bronze badges

Add a comment |

absoluteAquarian · Accepted Answer · 2022-05-04 16:47:00Z

TI-BASIC, 36 35 bytes

Repeat fPart(Ans/3)max(3≠int(10fPart(Ans₁₀^(seq(-X-1,X,0,log(Ans:Ans+1:End:Ans

Input is in Ans.
Output is in Ans and is implicitly printed when the program completes.

Examples:

Explantion:
(Newlines added for readability. They do not appear in the source code.)

Repeat                                              ;loop until...
  fPart(Ans/3)                                      ; the current number is not
                                                    ;  a multiple of 3
  max(3≠int(10fPart(Ans₁₀^(seq(-X-1,X,0,log(Ans     ; and until it does not
                                                    ;  contain any 3s
Ans+1                                               ;add 1 to the current number
End
Ans                                                 ;leave the current number
                                                    ; in "Ans" and implicitly
                                                    ; print it

Note: TI-BASIC is a tokenized language. Character count does not equal byte count.

-1 byte by removing the and (A and B ~ A*B = AB) [I think] — MarcMush, Commented May 4, 2022 at 14:36
@MarcMush and is a 1-byte token, so AB would be the only byte save of the two suggestions (A*B vs AB). Unless I misread your comment, in which AB would indeed be a byte saved. — absoluteAquarian, Commented May 4, 2022 at 16:43

naffetS · Accepted Answer · 2022-05-13 03:40:39Z

1

Vyxal, 10 bytes

λ›D₃$3c∨[x

Try it Online!

It would be 9 bytes with ₌ (parallel apply), but that seems to clear the stack, so that didn't work.

How?

λ›D₃$3c∨[x
λ           # Open a lambda (for recursion)
 ›          # Increment
  D         # Triplicate, push three copies of a to the stack
   ₃        # Is it divisible by three?
    $       # Swap
     3c     # Does the number contain a three?
       ∨    # Is either of the top two things on the stack true?
        [x  # Then recurse

edited May 13, 2022 at 3:40

answered Apr 26, 2022 at 2:35

naffetS

12.8k2 gold badges20 silver badges53 bronze badges

Add a comment |

The Thonnu · Accepted Answer · 2023-06-29 15:57:11Z

1

Thunno 2 `+`, 11 bytes

(D3Ḋsd3Ƈ|;⁺

Attempt This Online!

Explanation

(D3Ḋsd3Ƈ|;⁺  # Implicit input
             # Increment
(            # While loop
 D           # (condition)  Duplicate
  3Ḋ         #              Divisible by 3?
    s        #              Swap
     d       #              Digits
      3Ƈ     #              Contains 3?
        |    #              Logical OR
         ;⁺  # (body)  Increment
             # Implicit input

answered Jun 29, 2023 at 15:57

The Thonnu

18.3k3 gold badges16 silver badges74 bronze badges

Add a comment |

Shaggy · Accepted Answer · 2023-06-29 16:14:19Z

1

Japt, 12 bytes

_%3«Zsø3}a°U

Run it online

edited Jun 29, 2023 at 16:14

Shaggy

43.5k4 gold badges36 silver badges94 bronze badges

answered Mar 8, 2019 at 2:32

Oliver

7,9022 gold badges18 silver badges38 bronze badges

Add a comment |

bigyihsuan · Accepted Answer · 2023-06-30 13:23:00Z

1

Go, 100 bytes

import(."strings";."fmt")
func f(n int)int{i:=n+1
for;i%3<1&&Contains(Sprint(i),"3");i++{}
return i}

Try it online!

answered Jun 30, 2023 at 13:23

bigyihsuan

10.8k1 gold badge23 silver badges66 bronze badges

Add a comment |

pacman256 · Accepted Answer · 2023-11-28 14:30:24Z

1

+200

Vyxal 3, 9 bytes

э∥3c3Ḋ∵¬Ẇ

Try it Online!

answered Nov 28, 2023 at 14:30

pacman256

4,7181 gold badge9 silver badges32 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

C#, 49 bytes

int A(int n)=>(++n+"").IndexOf('3')*n%3<0?n:A(n);

Slightly different and shorter than the above c#, using recursion and another trick I came up with to condense the two conditions into one

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Mar 2, 2018 at 6:22

lee

2001 silver badge7 bronze badges

Add a comment |

maxb · Accepted Answer · 2019-03-18 15:04:54Z

MathGolf, 10 9 bytes

ö)_3‼╧÷+▲

Try it online!

Explanation

The program loops until it finds a number that is neither divisible by 3 or contains the number 3. ‼ is a new addition to MathGolf, and is newer than this challenge (and this answer). It has been an idea I had in mind for a while, but I finally got everything together to implement it.

ö           start block of length 7
 )          increment
  _         duplicate TOS
   3        push 3
    ‼       apply next two operators separately to the stack
     ╧      pop a, b, a.contains(b)
      ÷     is divisible
       +    pop a, b : push(a+b) (works as a logical OR)
        ▲   do while true with pop

bb94 · Accepted Answer · 2019-03-18 16:00:36Z

0

Perl 6, 39 bytes

{my$a=$_+1;$a++while $a%%3||$a~~/3/;$a}

answered Mar 18, 2019 at 16:00

bb94

3,70814 silver badges19 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

BotEngine, 770 107x7 = 749 (740 bytes)

This can almost certainly be made rather more compact than it currently is, but I finally managed to get it working at least.

v  0 1 2 3 4 5 6 7 8 9 $ $   0 1 2 3 4 5 6 7 8 9 $  0 1 2 3 4 5 6 7 8 9 $> 0 1 2 3 4 5 6 7 8 9 $v$ $3
I>>S S S S S S S S S S S>S$v>S S S S S S S S S S S >S S S S S S S S S S S >S S S S S S S S S S S>e>SS~v
R  e1e2e3e4e5e6e7e8e9e0e1>e ^e0e1e2e3e4e5e6e7e8e9e$ e0e1e2e3e4e5e6e7e8e9>^ e0e1e2e3e4e5e6e7e8e9>^  Re3  $
$e^                  < e$   ^<     <     <     <        <     <     <        <     <     <         P>  >S~v
>^ >>>>>>>>>>>>>>>>>>>>>^ ~<   >     >     >       ^<     <     <     <        <     <     <      ^   <^  <
                                 >     >     >        >     >     >       ^<     <     <     <          e$
  ^                                              <                                                      <

Input and output is in standard big-endian decimal, although most of the program uses little-endian internally to make the increment cycle more straightforwards.

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Binary-Encoded Golfical, 80 bytes

This binary-encoded format can be converted to the standard graphical version using the encoder utility included in the github repo, or run directly using the interpreter by adding the -x flag.

Hexdump of binary encoding:

01 70 03 15 14 14 1b 1a 14 04 01 14 14 2c 14 14
00 03 14 14 0a 01 14 14 2f 14 14 53 2d 14 23 1d
14 32 14 14 1b 14 1a 00 0a 14 14 0a 01 14 14 2f
14 14 53 31 14 06 03 14 14 23 1d 14 00 0a 14 14
0a 01 1c 14 2d 17 14 3d 2d 14 23 1d 14 1c 2c 1d

Original image (23x3):

enter image description here

Magnified 20x:

enter image description here

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Mar 20, 2019 at 0:14

SuperJedi224

12k1 gold badge45 silver badges68 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

APL(NARS), 54 chars, 108 bytes

r←h w;c
r←c←0
→3×⍳(0=3∣r)∨'3'∊⍕r⋄c+←1⋄→0×⍳r>w
r+←1⋄→2

I prefer this, the loop, to all recursive functions; test:

  h¨1 2 11 22 29 251    
2 4 14 25 40 254 
  h¨3 6 10   
4 7 11

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Mar 19, 2019 at 11:12

user58988

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

C, 59 bytes

n,m;f(){if(++n%3)for(m=n;m;m/=10)(m%10==3)?f():0;else f();}

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 13, 2019 at 21:48

luigig44

101

1

\$\begingroup\$ Welcome to PPCG! Which compiler did you use to test this? I can't seem to get it working with gcc, tcc, or clang. Also, functions are required to take input using one of these method. \$\endgroup\$
– Dennis
Commented Apr 14, 2019 at 1:24

Add a comment |

mkst · Accepted Answer · 2019-04-14 21:05:43Z

K (oK), 24 23 bytes

Solution:

(1+)/[{(~3!x)|51in$x};]

Try it online!

Explanation:

Iterate from input+1 until valid number is found. Bit of a cheat dropping whitespace between 51 and in.

(1+)/[{(~3!x)|51in$x};] / the solution
    /[{             };] / iterate (/) while {} is true
                  $x    / string x, e.g. 12 => "12"
              51in      / is "3" (51 in ASCII) in the string?
             |          / or
       (    )           / do this together
         3!x            / x modulo 3
        ~               / not
 1+                     / add 1 to x (e.g. x++)

Count without 3

Background

Task

Test cases

59 Answers 59

Google Sheets, 63 bytes

Swift, 84 bytes

C, 81 bytes

reticular, 30 bytes

Explanation

1: initialization

2: loop

3: final

Batch, 93 bytes

CJam, 19 bytes

Pyth, 19 bytes

Clojure, 73 bytes

Mathematica, 51 bytes

JavaScript, 35 bytes

Ruby, 29 bytes

Stax, 9 bytes

Forth (gforth), 81 bytes

Explanation

Code Explanation

Ruby, 39 bytes

Julia 1.0, 34 bytes

TI-BASIC, 36 35 bytes

Vyxal, 10 bytes

How?

Thunno 2 +, 11 bytes

Explanation

Japt, 12 bytes

Go, 100 bytes

Vyxal 3, 9 bytes

C#, 49 bytes

MathGolf, 10 9 bytes

Explanation

Perl 6, 39 bytes

BotEngine, 770 107x7 = 749 (740 bytes)

Binary-Encoded Golfical, 80 bytes

APL(NARS), 54 chars, 108 bytes

C, 59 bytes

K (oK), 24 23 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfmatharithmeticgame or ask your own question.

Linked

Related

Hot Network Questions

Thunno 2 `+`, 11 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
math
arithmetic
game
or ask your own question.