challengersy's blog

Help with Petr#113B
By challengersy, history, 8 years ago, In English

Hi, I tried to solve this problem. I used two vectors to store occurrences of both prefix and suffix; the problem was how to indicate that two sub-strings are different I looked for other submissions i notice that they used a map and a long long number to have this. my question is: wouldn't we have an overflow? how can we be sure that two different sub strings wouldn't have the same number as a result of overflow?

  • Vote: I like it
  • -13
  • Vote: I do not like it

Comments Comments (4)
| Write comment?
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

why -1vote? if the topic is not clear,I'll make it clear. if it's easy it won't waste your to help me little bit.

→ Reply
»
8 years ago, # |
  Vote: I like it +5 Vote: I do not like it

What is Petr#113B? It doesn't look like Codeforces Round 113 (Div. 2) whose B is a geometry problem...

→ Reply
»
8 years ago, # |
  Vote: I like it +9 Vote: I do not like it

maybe he's referring to this problem: 113B - Petr#

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

I'm sorry,myfault. I don't know that #113 refer to contest yes as Bruteforceman I meant 113B-Petr

→ Reply