Codeforces Round #262 (Div. 2)E（贪心+暴搜）

E. Roland and Rose

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Roland loves growing flowers. He has recently grown a beautiful rose at point (0, 0) of the Cartesian coordinate system. The rose is so beautiful that Roland is afraid that the evil forces can try and steal it.

To protect the rose, Roland wants to build n watch towers. Let's assume that a tower is a point on the plane at the distance of at most rfrom the rose. Besides, Roland assumes that the towers should be built at points with integer coordinates and the sum of squares of distances between all pairs of towers must be as large as possible. Note, that Roland may build several towers at the same point, also he may build some of them at point (0, 0).

Help Roland build the towers at the integer points so that the sum of squares of distances between all towers is maximum possible. Note that the distance in this problem is defined as the Euclidian distance between points.

Input

The first line contains two integers, n and r (2 ≤ n ≤ 8; 1 ≤ r ≤ 30).

Output

In the first line print an integer — the maximum possible sum of squared distances. In the i-th of the following n lines print two integers,xi, yi — the coordinates of the i-th tower. Each tower must be inside or on the border of the circle with radius r. Note that there may be several towers located at the same point of the plane, also some towers can be located at point (0, 0).

If there are multiple valid optimal arrangements, choose any of them.

Sample test(s)

input

4 1

output

16
0 1
0 1
0 -1
0 -1

input

3 6

output

312
0 6
5 -3
-5 -3

题意：给出半径r，要求在以原点为圆心，半径为r的圆内（含边界）找n个整点，使得两两之间距离的总和最大（多个点可以占据在同一位置）

思路：这题大概的思路是只选择距离原点范围在(r-1,r]和原点这些点，然后将这些点按距离从大到小排序，然后按顺序暴搜记录最优值即可

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         using namespace std; struct node{ int x,y,z; }; node p[300]; int xt[300]; int yt[300]; int xa[300]; int ya[300]; int d; int n; int maxi; bool cmp(node a,node b) { return a.z>b.z; } void dfs(int l,int cnt) { int i,j; if(cnt==n){ int x=0; for(i=0;i 
        
          maxi){ maxi=x; for(i=0;i 
         
           rs){ p[d].x=i; p[d].y=j; p[d++].z=x; } } sort(p,p+d,cmp); d=30-n*2;//d=17; dfs(0,0); printf("%d\n",maxi); for(i=0;i