CareerCup

public class SizedStack {
public static void main(String[] args) {
Stack test = new Stack(5);
try {
test.push(new NodeX("a"));
test.push(new NodeX("b"));
test.push(new NodeX("c"));
test.push(new NodeX("d"));
test.push(new NodeX("e"));
test.push(new NodeX("f"));
} catch (StackFullException e) {
System.out.println("overflow");
}
}
}

class Stack {
NodeX top;
int size;

Stack(int size) {
this.size = size;
}

NodeX pop() {
NodeX out = top;
top = top.next;
out.next = null;
return out;
}

void push(NodeX in) throws StackFullException {
int realSize = 0;
NodeX bottom = null;
while (top != null) {
realSize++;
if (bottom == null) {
bottom = top;
top = top.next;
bottom.next = null;
} else {
NodeX currentBottom = bottom;
bottom = top;
top = top.next;
bottom.next = currentBottom;
}
}
if (realSize < size) {
while (bottom != null) {
NodeX currentTop = top;
top = bottom;
bottom = bottom.next;
top.next = currentTop;
}
System.out.println(top);
in.next = top;
top = in;
} else {
throw new StackFullException();
}
}
}

class NodeX {
String name;
NodeX next;

NodeX(String name) {
this.name = name;
}

@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append(this.name);
if (this.next != null) {
sb.append(this.next.toString());
}
return sb.toString();
}
}

class StackFullException extends Exception {
StackFullException() {
super();
}

StackFullException(String message) {
super(message);
}

StackFullException(String message, Throwable cause) {
super(message, cause);
}

StackFullException(Throwable cause) {
super(cause);
}
}

def count(arr):
    z=[]
    perm = permutations(arr)
    
    for i in list(perm):
        z.append(list(i))
    q=[]
    
    for i in range(len(arr)-1):
        x,y=arr[i],arr[i+1]
        
        for j in range(len(z)):
            if z[j].index(x)!=len(z[j])-1:
                if z[j][z[j].index(x)+1]==y:
                    q.append(z[j])
                    
    for i in range(len(q)):
         if q[i] in z:
             z.remove(q[i])
    return len(z)
a= int(input())
b=list(map(int,input().strip().split()))
print(count(b))

You are given an integer array A of size N. Your task is to count and print the number of XOR-AND inversions in army A. A pair (^ prime ,^ prime )^ prime ) is said to be an XOR-AND inversion if and only if it satisfies the following conditions.

• 1 <= 1 < j <= N

• A[i] * 8A[j] >= A * [i] ^ A * [j]