using System.Collections.Generic;
public static void Main()
Console.WriteLine("Hello World");
long count (int k, int n)
var ewdiag = new bool[2*n-1];
var wediag = new bool[2*n-1];
bool isSolution(int k, int n)
public List<int> generate(int k, int n, int[] a, bool[] ew, bool[] we)
var result = new List<int>();
for (var i = k == 0 ? 0 : a[k-1]; i < n*n; i++)
if (!(ew[Ew(i)] || we[We(i)]))
int row(int cell, int n) => cell/n;
int col(int cell, int n) => cell%n;
int Ew(int cell, int n) => row(cell, n)-col(cell, n);
int We(int cell, int n) => row(cell, n)-(n-col(cell, n));