POJ 1543 Perfect Cubes

做水题爽啊，连题解都不用搜

这里比较坑的是pow()！一用就超时！老老实实乘就16MS

#include<stdio.h>int main(void){int N, i, j, k, n;long a[105] = {0};scanf("%d", &N);for( n = 6; n <= N; n++){a[n] = n * n * n;                                        // 拿个数组存一下时间会短一点，但是我试了一个，并没有明显变短，都存起来可能会好for( i = 2; i <= 10 * n / 14; i++){for( j = i + 1; j <= 10 * n / 12; j++){for( k = j + 1; k <= n; k++){if( i*i*i + j*j*j + k*k*k == a[n]){printf("Cube = %d, Triple = (%d,%d,%d)\n", n, i, j, k);}}}}}return 0;}

貌似还有丧心病狂打表法？算了不纠缠水题了