zoj 1331 Perfect Cubes
2010-10-31 22:15
281 查看
#include <stdio.h> int main(void) { int i,j,k,m; int a[202]; for (i=1;i<201;i++) a[i] = i*i*i; for (i=1;i<201;i++) for (j=2;j<201;j++) for (k=j;k<201;k++) for (m=k;m<201;m++) if (a[i] == a[j]+a[k]+a[m]) printf("Cube = %d, Triple = (%d,%d,%d)/n",i,j,k,m); return 0; }
好水阿,题上要求 10s 四个for循环1s都不到就a了
相关文章推荐
- zoj 1331 Perfect Cubes(水题)
- zoj 1331 Perfect Cubes
- zoj 1331 Perfect Cubes
- zoj 1331 Perfect Cubes
- ZOJ 1331 Perfect Cubes
- ZOJ 1331 - Perfect Cubes
- ZOJ Problem Set - 1331 Perfect Cubes 判断一个double是否为整数
- ZOJ Problem Set–1331 Perfect Cubes
- ZOJ 1331 Perfect Cubes
- poj 1543 & HDU 1334 & ZOJ 1331 Perfect Cubes(数学 暴力大法好)
- HDU1334 ZOJ1331 UVA386 UVALive5303 Perfect Cubes【暴力】
- Perfect Cubes(zoj_1331-————the beginner problem)
- zoj 1331 Perfect Cubes
- ZOJ-1331
- ZOJ 1331
- 1331_Perfect Cubes
- zoj 1331
- zoj 1331
- ZOJ 1331 完美立方体
- ZOJ1808 POJ1056 HDU1305 Immediate Decodability,Trie树