Code Obfuscation via Control Flow Flattening

sample input:

intmin(inta, intb) {
if((a<b)) {
returna;
}
returnb;
}
intCombination(intn, intk) {
intC[(n+1)][(k+1)];
inti;
intj;
for(i=0; (i <= n); (i++)) {
for(j=0; (j <= min(i, k)); (j++)) {
if(((j==0) || (j==i))) {
C[i][j] =1;
} else {
C[i][j] = (C[(i-1)][(j-1)] +C[(i-1)][j]);
}
}
}
returnC[n][k];
}
intmain() {
intn=0;
intk=0;
intc=Combination(n, k);
printf("(%d, %d) = %d\n", n, k, c);
return0;
}

sample output:

intmin(inta, intb) {
int__st__=1;
while(__st__) {
if((__st__==1)) {
if((a<b)) {
__st__=3;
continue;
}
__st__=2;
continue;
}
if((__st__==2)) {
returnb;
__st__=0;
continue;
}
if((__st__==3)) {
returna;
__st__=2;
continue;
}
}
}
intCombination(intn, intk) {
intC[(n+1)][(k+1)];
inti;
intj;
int__st__=1;
while(__st__) {
if((__st__==1)) {
i=0;
__st__=2;
continue;
}
if((__st__==2)) {
if((i <= n)) {
__st__=4;
continue;
}
__st__=3;
continue;
}
if((__st__==3)) {
returnC[n][k];
__st__=0;
continue;
}
if((__st__==4)) {
j=0;
__st__=5;
continue;
}
if((__st__==5)) {
if((j <= min(i, k))) {
__st__=7;
continue;
}
__st__=6;
continue;
}
if((__st__==6)) {
(i++);
__st__=2;
continue;
}
if((__st__==7)) {
if(((j==0) || (j==i))) {
__st__=9;
continue;
} else {
__st__=10;
continue;
}
__st__=8;
continue;
}
if((__st__==8)) {
(j++);
__st__=5;
continue;
}
if((__st__==9)) {
C[i][j] =1;
__st__=8;
continue;
}
if((__st__==10)) {
C[i][j] = (C[(i-1)][(j-1)] +C[(i-1)][j]);
__st__=8;
continue;
}
}
}
intmain() {
intn=0;
intk=0;
intc=Combination(n, k);
int__st__=1;
while(__st__) {
if((__st__==1)) {
printf("(%d, %d) = %d\n", n, k, c);
return0;
__st__=0;
continue;
}
}
}