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!
965 Solvers
All your base are belong to us
408 Solvers
1774 Solvers
Find nearest prime number less than input number
141 Solvers
133 Solvers
Tags