TicTacToe3D | Topcoder Archive

Problem Statement

Given n, return the number of distinct ways to put n X's on an n by n by n 3-D Tic Tac Toe Board such that the n X's are in a row.

The n in a row can be in a horizontal, vertical, or diagonal line.

Definition

Class:: TicTacToe3D
Method:: howMany
Parameters:: int
Returns:: int
Method signature:: int howMany(int n)
(be sure your method is public)

Constraints

n will be between 1 and 1000, inclusive.

Examples

```
1
```
```
Returns: 1
```
There is only one possible place to put the X, and it results in getting 1 in a row, so there is 1 way to get 1 in a row.
```
8
```
```
Returns: 244
```
```
500
```
```
Returns: 753004
```

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.