HASHIT - Hash it!

Your task is to calculate the result of the hashing process in a table of 101 elements, containing keys that are strings of length at most 15 letters (ASCII codes 'A',...,'z'). Implement the following operations:

  • find the index of the element defined by the key (ignore, if no such element),
  • insert a new key into the table (ignore insertion of the key that already exists),
  • delete a key from the table (without moving the others), by marking the position in table as empty (ignore non-existing keys in the table)

When performing find, insert and delete operations define the following function:
integer Hash(string key),
which for a string key=a1...an returns the value:
Hash(key)=h(key) mod 101, where
h(key)=19 *(ASCII(a1)*1+...+ASCII(an)*n).
Resolve collisions using the open addressing method, i.e. try to insert the key into the table at the first free position: (Hash(key)+j2+23*j) mod 101, for j=1,...,19. After examining of at least 20 table entries, we assume that the insert operation cannot be performed.

Input

t [the number of test cases <= 100]
n1 [the number of operations (one per line)[<= 1000]
ADD:string
[or]
DEL:string [other test cases, without empty lines betwee series]

Output

For every test case you have to create a new table, insert or delete keys, and write to the output:
the number of keys in the table [first line]
index:key [sorted by indices]

Example

Input:
1
11
ADD:marsz
ADD:marsz
ADD:Dabrowski
ADD:z
ADD:ziemii
ADD:wloskiej
ADD:do
ADD:Polski
DEL:od
DEL:do
DEL:wloskiej

Output:
5
34:Dabrowski
46:Polski
63:marsz
76:ziemii
96:z

Added by:mima
Date:2004-06-01
Time limit:3s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:-

hide comments
2011-04-14 10:33:16 kiransk
input with string length ZERO allowed?
eg: are these valid
ADD:
DEL:
2011-04-09 19:09:24 Piotr KÄ…kol
@Parag gupta - "(ignore insertion of the key that already exists)" - read the specification carefully and don't assume that the input is wrong not You.
2011-03-21 14:54:51 Parag gupta
the test case answer should be 6 and should contain "marsz" two times. one at index 63 and other at 87. explain plz..
2011-03-06 08:25:03 Madhavan
Do the strings have to be sorted according to their original hash value or acc to Hash(key) ?
2010-01-19 07:27:56 qiu wenfeng
No it doesn't
2010-01-13 18:20:39 Florian Beuter
Does the output need a separated line between the single testcases?

Last edit: 2010-01-13 18:20:55
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.