What are principles to have AC(0.001)? I got AC(0.078) by
using BFS in graf of triples(n1,n2,ves) where n1 and n2 number of cards taken from 1 and second piles and ves is difference between blacs and reds. Final condition is (N,N,0), starting - (0,0,0). This algorithm has O(N^2).
Is there radically faster way of O(N)?