UVA 356 || Square Pegs And Round Holes （圆能覆盖的格子数和边界穿过的格子数

上图为，n = 1,2,3;

可以观察出，圆边界穿过的格子数，就是蓝色正方形最外一圈的格子数： （ 2n-1 ) * 4

在推导圆覆盖的格子数的时候，我一开始想了圆的内接正方形。。

结果推出来的有误..n = 3 时就不能 用向下取整的正方形了。。

就把圆分四块暴力枚举。就ok了。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
double dist( int a ,int b)
{
    return   sqrt( a*a + b*b );
}

const double eps = 1e-6;
bool xd(double a,double b)
{
    return a < b+eps;
}

int main()
{
    int n,flag = 0;

    while(cin>>n)
    {
        if( flag )
            puts("");
        int onsegment = 0,incircle = 0;
        onsegment = ( 2* n -1) * 4;
        double r = (2.0* (double)n -1.0)*0.5;

        for( int i = 0 ; i < n;++i)
            for( int j = 0;j < n;++j)
            {
                if( xd(dist(i,j),r) && xd(dist(i+1,j),r)
                   &&xd(dist(i,j+1),r) &&xd(dist(i+1,j+1),r) )
                    incircle++;

            }

        printf("In the case n = %d, %d cells contain segments of the circle.\n",n,onsegment);
        printf("There are %d cells completely contained in the circle.\n",incircle*4);
        flag++;

    }

    return 0;
}

网上搜了个很精简的代码。。只是现在自己还不太明白。

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>

using namespace std;

int main()
{
	int n,in,on,count = 0;
	while (cin >> n) {
		in = 0,on = 0;
		double r,l = n-0.5;
		for (int i = 1 ; i < n ; ++ i) {
			r = sqrt((n-0.5)*(n-0.5)-i*i);
			on += ((int)(l+1-1e-12) - (int)(r+1-1e-12)+1)<<2;
			in += ((int)(r+1e-12))<<2;
			l = r;
		}
		on += ((int)(l+1-1e-10))<<2;
		if (count ++) printf("\n");
		printf("In the case n = %d, %d cells contain segments of the circle.\n",n,on);
		printf("There are %d cells completely contained in the circle.\n",in);
	}
    return 0;
}