HUD ACM 11 2007 平方与立方和

#include <iostream>
using namespace std;
int main()
{
	int Lu[80];
	int i = 0;
	int m, n;
	int x = 0;
	int Hui;
	int product1 = 0;
	int product2 = 0;
	while (cin >> m >> n)
	{
		int temp;
		if (m > n)
		{
			temp = m;
			m = n;
			n = temp;
		}

		Hui = m;

		while (x < (n - m + 1))
		{
			while (i < (n - m + 1))
			{
				Lu[i] = Hui++;
				i++;
			}
			if (Lu[x]%2 != 0)
			product1 += Lu[x] * Lu[x] * Lu[x];
			if (Lu[x]%2 == 0)
			product2 += Lu[x] * Lu[x];
			x++;
		} 
		cout << product2 << ' ' << product1 << endl;
		i = 0;
		x = 0;
		product1 = 0;
		product2 = 0;
	}
	return 0;
}