1128.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1128 on 2005-09-30 at 17:30:25 */ 
#include <stdio.h>
#define  MAX  100

int main()
{
	int cube[MAX+1];
	int i, j, k, l;
	int m, n, p;
	for(i = 2; i <= MAX; i++) {
		cube[i] = i * i * i;
	}
	for(i = 2; i <= MAX; i++) {
		n = cube[i];
		for(j = 2; j <= i; j++) {
			m = n - cube[j];
			if(m <= 0){
				continue;
			}
			for(k = j+1; k <= i; k++) {
				p = m - cube[k];
				if(p < 0) {
					continue;
				}
				for(l = k+1; l <= i; l++) {
					if(p == cube[l]) {
						printf("Cube = %d, Triple = (%d,%d,%d)\n", i, j, k, l);
					}
				}
			}
		}
	}
	
	return 0;
}