Function main

Spoj_problems/SAMER08F/solution.cpp:12–22

This method calculates no. of different squares in a given grid of N*N squares. The end of input is indicated by a line containing only one zero. This problem can also be solved using dp using eq => F(n) = n*2 + F(n-1) where F(1) = 1 However here we will use a simple formula. i.e., Sum of Squares = n*(n+1)*(2n+1)/6 */

	i.e., Sum of Squares = n*(n+1)*(2n+1)/6
*/
int main()
{
	jaadu;
	int n;
	cin>>n;
	while(n!= 0){
		cout<<(n)*(n+1)*(2*n + 1)/6<<endl;
		cin>>n;
	}
	return 0;
}