Open AurumnPegasus opened 4 years ago
For an array accepted from the user, where each element can be positive or negative, We need to display the number of times it can be trisected, that is, the sum is the same of all three parts eg: 5 1 2 3 0 3 ans : 2 {1,2},{3},{0,3} {1,2},{3,0},{3}
For an array accepted from the user, where each element can be positive or negative, We need to display the number of times it can be trisected, that is, the sum is the same of all three parts eg: 5 1 2 3 0 3 ans : 2 {1,2},{3},{0,3} {1,2},{3,0},{3}