Search found 3 matches

by alun
Mon Dec 09, 2002 6:36 pm
Forum: Volume 100 (10000-10099)
Topic: 10013 - Super long sums
Replies: 212
Views: 39834

the length of their sum does not exceed M
so this case is better:
1

4
0 8
0 9
0 9
1 9
by alun
Fri Nov 29, 2002 11:24 pm
Forum: Volume 4 (400-499)
Topic: 401 - Palindromes
Replies: 196
Views: 31406

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'; lu['2']='S';...
by alun
Fri Nov 29, 2002 9:03 pm
Forum: Volume 4 (400-499)
Topic: 400 - Unix ls
Replies: 93
Views: 17452

400 pe

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

Go to advanced search