OJ Board

so i went and read on hash functions, i can say i learned a lot on this subject.
i ended up using Jenkins One-at-a-time hash method as seen on wikipedia, and it does the job.

i finally got AC! it is taking 7.412 seconds which is quite a lot, but at least i got AC (ill try to improve it later ...

so i tried again today to solve this problem (# 902), but this time using an hashtable, by using the its_taking_forever_to_be_standard STL hash_map. the implementation is simple:

for every sub-string of size( input password size ):
try to find the sub-string on the hashtable.
found it? add 1 to its ...

"time limit exceded"

what im doing is quite simple: a binary search tree where each node has a string (possible password) and the number of times that string shows up on the input string, a simple example would be:


string: "mmedpnmm" password size: 2

mm:2
/ \
me:1 pn:1
/ /
ed:1 nm:1
\
dp ...

i dont know if this is the right thread to post this issue, but i couldnt find a better one: ive tried to submit the code (in c++) for this problem, thing is it gives me a compile error! ive tried 4 times already, and i havent received an email with the g++ output error messages.

on my pc, ive ...