boj 75

最新推荐文章于 2025-08-14 20:17:26 发布

u010961419

最新推荐文章于 2025-08-14 20:17:26 发布

阅读量162

点赞数

CC 4.0 BY-SA版权

分类专栏： oj

本文链接：https://blog.youkuaiyun.com/u010961419/article/details/84419991

oj 专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一个关于计算火焰圈破坏特定区域内石板数量的问题。输入火焰圈的半径，程序将输出被火焰至少触及两个点的石板总数。通过数学几何的方法解决了此问题，并提供了一段C++实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

Lich Sandro investigates the magic of fire. He is standing in the center of a huge square hall with floor space one million square kilometers. The floor of the hall is paved with square 1 × 1 meter stone slabs. When Sandro waves his staff, a fire circle of radius R meters springs up around him. The center of the circle coincides with the center of the hall and is located at the point of contact of four slabs. Sandro wants to calculate the number of slabs damaged by the fire. A slab is assumed to be damaged if it has at least two common points with the fire circle. The figure shows as an example the slabs damaged by the fire circle of radius 4:

Input

The input file contains multiple cases. Proceed until End Of File.

Each case contains the radius of the fire circle R > 0. This is an integer not exceeding 10⁵.

Output

Output the number of damaged slabs.

Sample Input

Sample Output

Hint:

Category: Geometry?

The max int value is about 2*10^9.

Such tip will never appear in formal Preliminary and Final games.

代码：

#include<iostream>
#include<cmath>
using namespace std;

int main()
{
	long long r;
	while(~scanf("%lld",&r))
	{
		long long sum = 0;
		long long r1 = r*r;
		for(long long i=r-1;i>=0;i--)
		{
			long long r2 = r1-i*i;
			double len = sqrt((double)r2);
			sum+=(long long)ceil(len);
		}
		printf("%lld\n",sum*4);
	}
}