[easy] number permutation challenge solution - golf edition

// Golfed version of: http://pastebin.com/1HHhHkYJ

// version 1: 185 bytes
int n[3]={1},k,i;c(){for(k=0,i=2;i>=0;n[i--]=1)if(++n[i]<8&&++k)break;}main(){while(c(),k)n[1]%2==0&&n[0]+n[1]+n[2]==12&&n[0]^n[1]&&n[0]^n[2]&&puts((char[4]){48+n[0],48+n[1],48+n[2]});}

// version 2: 184 bytes, shaved 1 byte with XOR
int n[3]={1},k,i;c(){for(k=0,i=2;i>=0;n[i--]=1)if(++n[i]<8&&++k)break;}main(){while(c(),k)n[1]%2^1&&n[0]+n[1]+n[2]==12&&n[0]^n[1]&&n[0]^n[2]&&puts((char[4]){48+n[0],48+n[1],48+n[2]});}