[SC2B Key Contest]Supply Depot Forts

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//standard C libraries

int array[1000005]; 
//array that stores the number of solutions using 1-1000000 supply depots

int main()
{
	memset(array,0,sizeof(array)); 
	//setting everything to 0 initially

	for(int i=1;i<=249999;i++)
	//the width of center blank square AKA, i am assuming an 
	//i x i square. 249999 is the maximum width possible with 
	//1000000 supply depots used (1000000-4)/4
	{
		int sum=0;
		//the number of boxes used at the moment

		//the following section of the code basically adds 
		//"supply depot layers" to the center square 1 by 1
		for(int j=i;;j+=2)
		{
			int k=j*4+4;
			sum+=k;
			if(sum>1000000) break;
			array[sum]++;
		}
	}
	int temp,c;
	c=0;

	//the final part computes f(1) to f(10) from what was 
	// found previously
	for(temp=1;temp<=10;temp++)
	{
		for(int i=1;i<=1000000;i++)
		{
			if(array[i]==temp)c++;
		}
	}
	printf("%d\n",c);
	system("PAUSE");
}