CF 392 Blocked Points

c. Blocked Points

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Imagine you have an infinite 2D plane with Cartesian coordinate system. Some of the integral points are blocked, and others are not. Two integral points A and B on the plane are 4-connected if and only if:

• the Euclidean distance between A and B is one unit and neither A nor B is blocked;
• or there is some integral point C, such that A is 4-connected with C, and C is 4-connected with B.

Let's assume that the plane doesn't contain blocked points. Consider all the integral points of the plane whose Euclidean distance from the origin is no more than n, we'll name these points special. Chubby Yang wants to get the following property: no special point is 4-connected to some non-special point. To get the property she can pick some integral points of the plane and make them blocked. What is the minimum number of points she needs to pick?

Input

The first line contains an integer n (0 ≤ n ≤ 4·107).

Output

Print a single integer — the minimum number of points that should be blocked.

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<map>
#include<stack>
#include<math.h>
using namespace std;

int main()
{
  //  freopen("in.txt","r",stdin);
   int n;
  while(~scanf("%d",&n))
  {
   int se=-1;
   int ans=0;
   long long N=1ll*n*n;//注意int范围！！
   for(int i=1;i<=n;i++)
   {
      int tp=sqrt(N-1ll*i*i);
      if(se==-1) se=tp;
      else
      {
          if(se==tp) ans++;
          else ans+= se-tp;
          se=tp;
      }
   }
   ans=(++ans)*4;
   if(n==0) ans=1;
   printf("%d\n",ans);
  }


    return 0;
}