Bathroom set1

#include<stdio.h>
int min(int a,int b){
    return (a < b ? a : b);
}
int max(int a,int b){
    return (a > b ? a : b);
}
bool debug = false;
int main()
{
    int T;
    scanf("%d",&T);
    for(int _ = 1 ; _ <= T ; _ ++){
        int ansls;
        int ansrs;
        int n,k;
        scanf("%d %d",&n,&k);
        bool br[n+2]; for(int i=0;i<n+2;i++) br[i] = false;
        br[0] = true;br[n+1] = true;
        for(int p = 1 ; p <= k ; p ++){
            int minlr = -1;
            int cntidx = 0;
            int idx[n+2];
            int lofp[n+2];
            int rofp[n+2];
            for(int i=1;i<=n;i++){
                int l = i,r = i;
                while(!br[l])l--;
                while(!br[r])r++;
                lofp[i] = i - l - 1;
                rofp[i] = r - i - 1;
                l = i - l - 1;
                r = r - i - 1;
                if(min(l,r) >= minlr){
                    if(min(l,r) == minlr){
                        cntidx++;
                        idx[cntidx] = i;
                    }
                    else{
                        cntidx = 0;
                        idx[0] = i;//min(l,r);
                    }
                    minlr = min(l,r);
                }
            }
            if(debug){
                printf("Test %d\n",cntidx);
                for(int i=0;i<=cntidx;i++){
                    printf("%d ",idx[i]);
                }
                printf("\n");

            }
            if(cntidx >= 1){
                int maxlr = -1;
                int ans;
                bool more = false;
                for(int i=0;i<=cntidx;i++){
                    if(debug)printf("Test %d (%d,%d)\n",idx[i],lofp[idx[i]],rofp[idx[i]]);
                    maxlr = max(maxlr,max(lofp[idx[i]],rofp[idx[i]]));
                }

                int cntlm = 0;
                for(int i=0;i<=cntidx;i++){
                    if(max(lofp[idx[i]],rofp[idx[i]]) == maxlr){
                        cntlm++;
                        if(cntlm >= 2){
                            br[ans] = true;
                            ansls = lofp[ans];
                            ansrs = rofp[ans];
                            break;
                        }
                        ans = idx[i];
                    }
                }
                if(cntlm == 1){
                    br[ans] = true;
                    ansls = lofp[ans];
                    ansrs = rofp[ans];
                }
            }else{
                br[idx[0]] = true;
                ansls = lofp[idx[0]];
                ansrs = rofp[idx[0]];
            }
            if(debug){
                printf("Test\n");
                for(int i=0;i<n+2;i++){
                    printf("%d ",br[i]);
                }
                printf("\n");

            }
        }
        printf("Case #%d: %d %d\n",_,max(ansls,ansrs),min(ansls,ansrs));
    }
}