Return how many Triangular Tiling grid points there are inside a circle of radius r centred at (0,0) (including points on the edge).
Assume that a Triangular Tiling grid is a 2D Hexagonal Bravais lattice with | a1 | = | a2 | = 1 and φ = 120°.
Neither string operations nor interpolations are allowed!
1255 Solvers
320 Solvers
195 Solvers
Flag largest magnitude swings as they occur
496 Solvers
Sum of odd numbers in a matrix
207 Solvers
Tags