Shrimb's blog

By Shrimb, history, 2 years ago, In English

Hello codeforces queens

its t7ya back at it again with the fire blogs

so peep this submission:

https://mirror.codeforces.com/contest/1702/submission/163553251

this guy avoided getting hacked without having to use neal's unordered map stuff or similar hashing functions. just one include. can anybody explain how this works. is it hackable?

shout out to my man almosabhali. mans a genius

  • Vote: I like it
  • +36
  • Vote: I do not like it

| Write comment?
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Shrimb (previous revision, new revision, compare).

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

wtf you can write "and" instead of "&&"??????

»
2 years ago, # |
  Vote: I like it +42 Vote: I do not like it

https://mirror.codeforces.com/contest/1702/hacks/827637

They simply found a different hashmap that no one's heard of yet. If you poke around in the source file of ext/hash_map it works exactly the same way as unordered_map, just with a different prime list.

The List