Submit solution

Points:
3

Time limit:
2.0s

Memory limit:
64M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

##### DWITE Online Computer Programming Contest, December 2010, Problem 2

Rectangles can be constructed out of smaller squares. Given a supply of unit squares ( in size), how many unique rectangles can be constructed?

The input will contain 5 lines, each an integer , a number of unit squares available.

The output will contain 5 lines, each a number of unique rectangles that can be constructed from **up to ** unit squares (not all squares have to be used for some of the rectangles).

*Note:* a rectangle is unique if another rectangle that had previously been constructed can't be rotated to look the same way. That is, and are considered to be the same.

#### Sample Input

```
2
6
```

#### Sample Output

```
2
8
```

## Comments