B. Counting Solutions of an Integer Equation |
Given, n, count the number of solutions to the equation x+2y+2z=n, where x,y,z,n are non negative integers.
There is at most 1500 inputs. Each input is n (n<1000001) on a single line.
For each input, output the number of solutions on a single line.
2 3
3 3
Problem setter: Josh Bao