First uncategorized solution for Counting Tiles by manub - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Uncategorized category for Counting Tiles by manub

from math import pi,floor,ceil
def checkio(radius):
    xmax=ceil(radius)
    complete=0
    partial=0
    for i in range (0,xmax):
        for j in range (0,xmax):
            if (i+1)**2+(j+1)**2<=radius**2:
                complete+=1
            if (i+1)**2+(j+1)**2>radius**2 and i**2+j**2
                        Nov. 11, 2012

                        
                            Comments:
                            
                                
                                    lesenv
 on Nov. 6, 2013, 8:37 p.m.

                                    <pre class='brush: python'>            if (i+1)**2+(j+1)**2&gt;radius**2 and i**2+j**2&lt;radius**2:
</pre>

<p>you could have omitted the first term and use elif.</p>

<p>my solution is exactly like this.</p>

                                
                            
                                
                                    mombius
 on Jan. 5, 2014, 8:56 p.m.

                                    <p>I used the same approach, but divided the circle in 8 parts instead of 4 and counted the tiles in main diagonal in the end. Also the 'partial' or 'complete' check could be done more efficiently if first we check if 'partial' (nearest corner of tile inside circle) and then if also 'complete' (farthest corner inside).</p>

                                
                            
                                
                                    sodium
 on Feb. 8, 2014, 8:52 a.m.

                                    <p>I forgot that circle is symmetrical.</p>

Ice Base

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!