해선 안될짓을 좀 하긴했지만,
삼항연산자 최고 >_<b

http://codepad.org/3NkuI1EJ


<pre>#include <stdio.h>

int main(void)
{
        char s[] = \"cat and dog 1234567 12 1234\";
        int c = 0, p = 0, b = 0, t = -1;
        for(;
                (t < 0)?
                (
                        (s[p] == \' \' || s[p] == 0)?
                        (
                                t++,
                                b = c,
                                c = s[p] ? p+1 : 0xffffff
                        ):s[p++]
                ):(
                        (t >= (p-b)/2)?
                        (
                                t=-1,
                                p++,
                                c!=0xffffff
                        ):(
                                c |= s[b + t] << 24,
                                s[b + t] = s[p - 1 - t],
                                s[p - 1 - t] = (c >> 24) & 0xff,
                                c &= 0xffffff,
                                t++,
                                1
                        )
                );
        );
        puts(s);
        return 0;
}

</pre>