@Test
public void case30() {
int N = 10;
int[] points = {1, 5, 8, 10};
assertEquals(116, polygontraversal2.count(N, points));
}
@Test
public void case9() {
int N = 5;
int[] points = {1, 5, 3, 2};
assertEquals(1, polygontraversal2.count(N, points));
}
@Test
public void case12() {
int N = 6;
int[] points = {2, 4, 6};
assertEquals(1, polygontraversal2.count(N, points));
}
@Test
public void case55() {
int N = 13;
int[] points = {12, 3, 4, 5, 6, 7, 8};
assertEquals(34, polygontraversal2.count(N, points));
}
@Test
public void case57() {
int N = 13;
int[] points = {3, 7, 10};
assertEquals(70168, polygontraversal2.count(N, points));
}
@Test
public void case50() {
int N = 13;
int[] points = {7, 3, 12};
assertEquals(101044, polygontraversal2.count(N, points));
}
@Test
public void case53() {
int N = 13;
int[] points = {7, 8, 9, 1, 2, 3, 4, 5, 10, 11, 12, 6};
assertEquals(1, polygontraversal2.count(N, points));
}
@Test
public void case36() {
int N = 12;
int[] points = {6, 11, 12, 1};
assertEquals(1140, polygontraversal2.count(N, points));
}
@Test
public void case37() {
int N = 12;
int[] points = {6, 11, 12, 1, 3};
assertEquals(326, polygontraversal2.count(N, points));
}
@Test
public void case3() {
int N = 7;
int[] points = {1, 2, 3, 4, 6, 5};
assertEquals(0, polygontraversal2.count(N, points));
}
@Test
public void case34() {
int N = 11;
int[] points = {11, 10, 2, 3, 7, 1};
assertEquals(20, polygontraversal2.count(N, points));
}
@Test
public void case33() {
int N = 11;
int[] points = {10, 3, 7, 1, 11};
assertEquals(146, polygontraversal2.count(N, points));
}
@Test
public void case32() {
int N = 11;
int[] points = {1, 3, 11, 6};
assertEquals(56, polygontraversal2.count(N, points));
}
@Test
public void case31() {
int N = 11;
int[] points = {5, 6, 8, 1};
assertEquals(86, polygontraversal2.count(N, points));
}
@Test
public void case48() {
int N = 13;
int[] points = {1, 7, 11};
assertEquals(154108, polygontraversal2.count(N, points));
}
@Test
public void case38() {
int N = 12;
int[] points = {5, 7, 1, 9, 10};
assertEquals(796, polygontraversal2.count(N, points));
}
@Test
public void case49() {
int N = 13;
int[] points = {1, 6, 11};
assertEquals(133032, polygontraversal2.count(N, points));
}
@Test
public void case39() {
int N = 12;
int[] points = {10, 11, 12, 3, 8, 1, 5, 2};
assertEquals(10, polygontraversal2.count(N, points));
}
@Test
public void case52() {
int N = 11;
int[] points = {1, 5, 10};
assertEquals(1412, polygontraversal2.count(N, points));
}
@Test
public void case41() {
int N = 13;
int[] points = {1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 10, 13};
assertEquals(1, polygontraversal2.count(N, points));
}
@Test
public void case54() {
int N = 11;
int[] points = {1, 3};
assertEquals(0, polygontraversal2.count(N, points));
}
@Test
public void case42() {
int N = 13;
int[] points = {1, 2, 13, 4, 5, 11, 7, 8, 9, 12};
assertEquals(6, polygontraversal2.count(N, points));
}
@Test
public void case56() {
int N = 13;
int[] points = {1, 5, 10};
assertEquals(103784, polygontraversal2.count(N, points));
}
@Test
public void case43() {
int N = 13;
int[] points = {6, 2, 12};
assertEquals(70168, polygontraversal2.count(N, points));
}
@Test
public void case7() {
int N = 4;
int[] points = {1, 2, 4};
assertEquals(0, polygontraversal2.count(N, points));
}
@Test
public void case46() {
int N = 13;
int[] points = {13, 1, 5};
assertEquals(0, polygontraversal2.count(N, points));
}
@Test
public void case10() {
int N = 5;
int[] points = {5, 2, 1};
assertEquals(0, polygontraversal2.count(N, points));
}
@Test
public void case47() {
int N = 13;
int[] points = {8, 6, 1, 5, 13};
assertEquals(1576, polygontraversal2.count(N, points));
}
@Test
public void case13() {
int N = 6;
int[] points = {6, 5, 2};
assertEquals(0, polygontraversal2.count(N, points));
}
@Test
public void case29() {
int N = 10;
int[] points = {1, 5, 8};
assertEquals(400, polygontraversal2.count(N, points));
}