int a[10][10]= {0,1,0,1,0,0,0,0,0,0,

int a[10][10]= {0,1,0,1,0,0,0,0,0,0, 1,0,0,0,0,0,1,1,1,1, 0,0,0,0,1,1,0,0,0,0, 1,0,0,0,0,0,1,1,1,1, 0,0,1,0,0,0,0,0,0,0, 0,0,1,0,0,0,0,0,0,0, 0,1,0,1,0,0,0,0,0,0, 0,1,0,1,0,0,0,0,0,0, 0,1,0,1,0,0,0,0,0,1, 0,1,0,1,0,0,0,0,1,0}; a[i][j]的意思是第i+1条边与第j+1条边有交点。移动层数时要按照原来的布置。举个例子，三条线两两相见。将第二条绳子和第三条绳子移到第二层，第一条绳子就没交点。但第二条绳子和第三条绳子在第二层还是有一个交点，所以第二条绳子或第三条绳子移到第三层。这样3层都没交点了，输出最小层数三。现在有十条绳子，求得最小的层数使得每层无交点 。 移动是向上平移到另一层