- #1
- 28,953
- 4,252
http://www.ams.org/journals/bull/1966-72-06/S0002-9904-1966-11654-3/
Funny thing, this:
finds their solution in around 2 sec on my i7 (compiled to x64, no idea what code optimizations are done automatically and there are plenty of things that can be done) so it can be up to 8 times faster if split between threads. I wonder how long it took on CDC.
Funny thing, this:
Code:
#define p5(__i__) (__i__*__i__*__i__*__i__*__i__)
int main(int argc, _TCHAR* argv[])
{
__int64 i, j, k, l, m;
for (i = 1;i < 200;i++)
for (j = 1;j < i;j++)
for (k = 1;k < j;k++)
for (l = 1;l < k;l++)
for (m = 1;m < k;m++)
if (p5(i) == p5(j) + p5(k) + p5(l) + p5(m))
printf("%I64d -> %I64d %I64d %I64d %I64d\n",i,j,k,l,m);
return 0;
}
finds their solution in around 2 sec on my i7 (compiled to x64, no idea what code optimizations are done automatically and there are plenty of things that can be done) so it can be up to 8 times faster if split between threads. I wonder how long it took on CDC.
Last edited: