OJ Board

the length of their sum does not exceed M

so this case is better:
1

4
0 8
0 9
0 9
1 9

try this...


int main() {
char inp[21],lu[100]={0},lm[100]={0};
int i,j,k,m,y,t;
lu['A']='A'; lu['E']='3'; lu['H']='H'; lu['I']='I';
lu['J']='L'; lu['L']='J'; lu['M']='M'; lu['O']='O';
lu['S']='2'; lu['T']='T'; lu['U']='U'; lu['V']='V';
lu['W']='W'; lu['X']='X'; lu['Y']='Y'; lu['Z']='5 ...

i always got PE for this problem...
anyone know the right answer ?
thx in advance