Hi everyone!

I'm looking for classic problem: Given a string A and Q strings B_1, B_2, .., B_Q. For each i count the number of occurrence of the string B_i in string A.

Can you give me the link to the above problem in some online judge sites. Thanks

Hi tourist! I have a question for you.

The most two recently company contest, i.e Zettolab and Rockethon contests, the prize for winner is a Iphone, and tourist won both.

I wonder, how many Iphone tourist got from programming contests :P?

As you all know, NEERC regional is hardest site in the World(I think so). even NEERC subregionals seem like too hard to me. But I can't find the problem set of these subregional(even in this website http://neerc.ifmo.ru/information/index.html). I just find some problem set in Gym CodeForces. Is there any one know where I can find those problem sets?

You know in ACM ICPC contest(and CodeForces + TopCoder contest also), the coding speed is very important.

I am writing this blog to make a survey: What is your coding speed? how many line of code per 10 seconds for example? I have a plan to speed up my typing speed for better result in ACM ICPC contest. Now I can type just by using 2 main finger(What a shame)