#define true 1
#define false 0
+#define static
+
//static int *row;
// queen in column c is at row[c]
int j = 0;
boolean res;
+#if 0
+ if(0 >= i)
+ return true;
+
+ do {
+ int rj = r[j];
+ if ((rj == ri) || ((myabs(ri-rj)) == (i-j))) {
+ res = false;
+ return(res);
+ }
+ j = j+1;
+ } while(j < i);
+
+ res = true;
+ return(res);
+#else
while (j < i) {
int rj = r[j];
if ((rj == ri) || ((myabs(ri-rj)) == (i-j))) {
res = true;
return(res);
+#endif
}
int solve (int n) {