#include #include #define Z(a) ; } void a(void){ #define z(a) _[o][a] #define B 2,8,4,6,3,7, #define C return #define D else #define G(a) ; z(a)+=n #define H for( #define I if( FILE*l; typedef int w; typedef unsigned char*b; b q,p,d="!!\0 !\xff\1UTF-8\0!\x81IOCCC!\1\xff\xfe\377can not open!\0! \0\xef\xbb\277EUC-JP\0 'PoPoPo\4""0?PoPo\3\20\17Po\2\1\"\xef\xbc\x81Shift_JIS\0!\xa1\xaaQO\220,\2""0?\220,\2\1UCS-2LE\0qxq.\2}}q.\2`$q.\2),q.\2^^q.\2__q.q.\3\1UCS-2BE\0"; w N,E,K,O,n,e,k,o,s,f,t[]={ 23,24,43} ,_[5][19]={ { B B 96,0,21,40,103,9,0} ,{ B B 96,38,5,1,144,9,7} ,{ B B 53,4,75,3,8,8,3} ,{ B 161,1,5,2,3,33089,92,4,14,3,79,350,0} ,{ B 36513,1,8,2,3,41378,111,4,89,3,46,767,4} } ; w g(w a){ H f=0; f0?fwrite(A,a,1,stdout):0 Z(r)q=(b)malloc(N*=2)Z(R)free(p)Z(m)N=64; r(); H E=0; !feof(l); E+=fread(q+E,1,N-E,l))I E==N){ p=q; r(); H s=0; s4&&k+1; p++)I q[n+s]<(*p^208)||q[n+s]>(p[1]^208)){ I s)k=-1; D H; *p>4; p++); } D{ s++; p++; } H s=0; k+1&&s<*p; s++)k=(k<<8)|q[n++]; k=(o==2&&k>7<<21)?((k>>4)&61440)|((k>>2)&4032)|(k&63):o?k:(k>>8)|((k&255)<<8)Z(j)i(); I k<0)n++Z(u)H n=0; n<3; n++)I *q==d[t[n]]&&q[1]==d[t[n]+1]&&(n<2||q[2]==d[t[n]+2])){ o=n; C; } H n=0; n=z(17)&&kz(18))o=n Z(x)p=d+z(k>255?14:13); h(p+1,*p-31); } w main(w A,char**a){ H o=5; o-->0; z(8)=44){ z(0)=33; z(2)=46; z(3)=63; } H; ++o<3; z(17)=145+(z(7)=1+(z(11)=12289)))z(10)=3+(z(6)=66+(z(5)=17+(z(4)=2+(z(9)=11+(z(1)=65281))))); H ; o<5; o++){ z(6)+=z(10)G(1)=z(11)G(4)G(5)G(7)G(9)G(17); } I *++a)H; *a; ++a){ printf("%s: ",*a); e=26; I l=fopen(*a,"rb")){ m(); fclose(l); u(); e=z(16); p=q; R(); } puts(d+e); } D{ l=stdin; m(); u(); H n=e=0; n