Give me please 37 test.

first of all try
test
1
1 1
all answer will be 0

here is my code

[code deleted]

Edited by moderator 20.10.2019 21:28

This is my code

import java.util.*;

public class Task_2010 {
 static void kingStep(int n, int x, int y){
  long countKing = 0;
  if((x - 1) > 0) countKing++;
  if((x - 1) > 0 && y + 1 <= n) countKing++;
  if((y + 1) <= n) countKing++;
  if((x + 1) <= n && (y + 1) <= n) countKing++;
  if((x + 1) <= n) countKing++;
  if((x + 1) <= n && (y - 1) > 0) countKing++;
  if((y - 1) > 0) countKing++;
  if((x - 1) > 0 && (y - 1) > 0) countKing++;
  System.out.println("King: " + countKing);
 }
 static void knightStep(int n, int x, int y){
  long countKnight = 0;
  if((x - 2) > 0 && (y + 1) <= n) countKnight++;
  if((x - 2) > 0 && (y - 1) > 0) countKnight++;
  if((y + 2) <= n && (x - 1) > 0) countKnight++;
  if((y + 2) <= n && (x + 1) <= n) countKnight++;
  if((x + 2) <= n && (x + 1) <= n) countKnight++;
  if((x + 2) <= n && (y - 1) > 0) countKnight++;
  if((y - 2) > 0 && (x + 1) <= n) countKnight++;
  if((y - 2) > 0 && (x - 1) > 0) countKnight++;
  System.out.println("Knight: " + countKnight);
 }
 static long bishopStep(int n, int x, int y) {
  long countBishop = 0;
  int left = x - 1;
  int right = n - x;
  if(y + left <= n){
    countBishop += left;
  } else countBishop += n - y;
  if(y + right <= n){
    countBishop += right;
  } else countBishop += n - y;
  if(y - left > 0){
    countBishop += left;
  } else countBishop += y - 1;
  if(y - right > 0){
    countBishop += right;
  } else countBishop += y - 1;
  System.out.println("Bishop: " + countBishop);
  return countBishop;
 }
 static long rookStep(int n, int x, int y){
  long countRook = (x - 1) + (n - x) + (y - 1) + (n - y);
  System.out.println("Rook: " + countRook);
  return countRook;

 }
 public static void main(String[] args){
  Scanner sc = new Scanner(System.in);
  int n = sc.nextInt();
  int x = sc.nextInt();
  int y = sc.nextInt();

  kingStep(n,x,y);
  knightStep(n,x,y);
  long queen = (bishopStep(n,x,y) + rookStep(n,x,y));
  System.out.println("Queen: " +  queen);

 }
}

There is an interesting way to code it.

For each piece we can have a function like this:
pair<string, int> get_king(int n, int x0, int y0)
{
  int cnt = 0;
  for (int dx = -1; dx <= 1; dx++)
    for (int dy = -1; dy <= 1; dy++)
      if (dx != 0 || dy != 0)
      {
        int x = x0 + dx;
        int y = y0 + dy;
        cnt += (x >= 1 && x <= n && y >= 1 && y <= n);
      }

  return { "King", cnt };
}

In the main code we just do the following loop:
for (auto get : { get_king, get_knight, get_bishop, get_rook, get_queen })
{
  auto res = get(n, x, y);
  cout << res.first << ": " << res.second << endl;
}

After that the function for queen look very easy:
pair<string, int> get_queen(int n, int x0, int y0)
{
  int cnt = get_rook(n, x0, y0).second + get_bishop(n, x0, y0).second;
  return { "Queen", cnt };
}

If you have any ideas on how to code it better, please write them here :)

At first check all tests with n<=4. If all of them cheked already then try to check all cells for n=8 (1/1; 1/2; 1/3; 1/4; 2/2; 2/3....)and for n=9. Don't be afraid you'll find your mistake on first tests))

Edited by author 10.07.2016 14:33

I have WA#16, give me some tests please

Edited by author 09.11.2014 18:38

Can anyone give me 20 test? I have WA and i don't know why

What is test num. 15?

// del
got AC

Edited by author 26.11.2015 22:07

http://hastebin.com/luqeribeha.avrasm -my code
no ideas why :(

IF YOU HAVE TL #33

TRY TEST:
1
1 1

FUNNY BUG=)

I'm getting WA#4, can you give some tests?