{"version":"1.0","type":"rich","title":"Finds best (closest to square) grid sides for a number of square tiles","description":"This example visualizes the dimensions of a grid—specifically, the closest-to-square pair of integers that can perfectly contain a given number of square tiles. It determines these dimensions by iterating through possible grid widths, testing for divisibility, and retaining the last valid pair. The implementation, written in C++, uses no external visualization libraries; instead, it relies on the standard `sqrt` and `ceil` functions from the math library to bound the search. The resulting grid dimensions are output as plain integer values, with no graphical rendering.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-79046b50667d2a5b9883?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}