LAGRANGE  Lagrange’s FourSquare Theorem
The fact that any positive integer has a representation as the sum of at most four positive squares (i.e. squares of positive integers) is known as Lagrange's FourSquare Theorem. The first published proof of the theorem was given by JosephLouis Lagrange in 1770. Your mission however is not to explain the original proof nor to discover a new proof but to show that the theorem holds for some specific numbers by counting how many such possible representations there are.
For a given positive integer n, you should report the number of all representations of n as the sum of at most four positive squares. The order of addition does not matter, e.g. you should consider 4^2 + 3^2 and 3^2 + 4^2 are the same representation.
For example, let's check the case of 25. This integer has just three representations 1^2+2^2+2^2+4^2, 3^2 + 4^2, and 5^2. Thus you should report 3 in this case. Be careful not to count 4^2 + 3^2 and 3^2 + 4^2 separately.
Input
The input is composed of at most 255 lines, each containing a single positive integer less than 2^15 , followed by a line containing a single zero. The last line is not a part of the input data.
Output
The output should be composed of lines, each containing a single integer. No other characters should appear in the output. The output integer corresponding to the input integer n is the number of all representations of n as the sum of at most four positive squares.
Example
Input: 1 25 2003 211 20007 0 Output: 1 3 48 7 738
hide comments
DHEERAJ KUMAR:
20160608 04:53:21
Try this too https://www.codechef.com/problems/CHEFMATH/ 

DHEERAJ KUMAR:
20160608 04:51:24
Wondering how people did this in 0.00 sec. Mine .15 :(


Archangel:
20141214 00:54:23
I got two TLEs then learnt how to optimize, simple brute force won't pass. 

Sourangsu :
20131228 21:03:59
Sad to see...so few submissions for this problem...quite easy.. 

~!(*(@*!@^&:
20100411 04:34:28
2^15; not 10^15 
Added by:  Daniel Gómez Didier 
Date:  20081119 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO 
Resource:  2008 U.Catolica & U.Central  Circuito de maratones ACIS / REDIS 