nitor's blog

Presenting Tourist Facts
By nitor, history, 3 years ago, In English

Hello everyone!

I am excited to show a project I've been working on these days — It's called "Tourist Facts".

You can access the website at touristfacts.dikson.xyz.

This is a compilation of facts (some haters would call them "absurd hyperbolic claims") about tourist, inspired in things like Chuck Norris facts.

Suggesting new facts is really simple! — just login to your GitHub account, submit an issue (by clicking here), type the facts you want to add (one per line) and hit "submit new issue". — I'll review the facts, and if they are funny, original and respectful, I'll tag the issue with a "accepted" label, all lines will be automatically added to the database and each fact will have a link to your GitHub profile as credit.

This project is open source <3 — For more info, check it's GitHub repository!

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

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

Haha, So funny

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

heuheuehue

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

omg that's amazing lol

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

This is why programmers eat hashbrowns from McDonalds.

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

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

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

Tourist can get accepted verdicts without even typing the code.

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

    Tourist can code without even reading the problem statement.

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

    Because he has taken the red pill instead of the blue one.

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

    Tourist can write and submit code in his mind and get accepted in Codeforces web.

    → Reply
»
3 years ago, # |
← Rev. 2   Vote: I like it +10 Vote: I do not like it

It was really funny..

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

tourist, reaction video?

→ Reply
»
3 years ago, # |
  Vote: I like it +33 Vote: I do not like it
another fact-meme
→ Reply
»
3 years ago, # |
  Vote: I like it +270 Vote: I do not like it

Authors panic about the correctness of their model solutions when tourist gets WA.

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

Really funny.

I eat tourist in a treap:(

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

When Tourist was in sixth grade won his first medal on IOI.

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

Tourist fact : Tourist wakes up with 98754304948703559407 pings on cf everyday.

Btw fun project. Loved it ^_^

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

If tourist loses red rating then Codeforces will literally go down.

https://codeforces.net/blog/entry/18825?#comment-237943

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

Tourist facts: System testing is done so as to recheck the solutions of participants against tourist's code!

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

Tourist doesn't need viagra. He's always NP-Hard.

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

If tourist marries a pupil their child (with their average rating), would still be a Grand Master.

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

Tourist doesn't even need a keyboard to write code. The code writes itself, under the force of tourist's mind.

→ Reply
»
3 years ago, # |
← Rev. 2   Vote: I like it +41 Vote: I do not like it
This is really funny hihihihi
→ Reply
»
3 years ago, # |
  Vote: I like it +46 Vote: I do not like it

When tourist get a wrong answer verdict, the author apologizes for creating wrong test cases.

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

Tourist's favourite music is segment tree beats.

→ Reply
  • »
    »
    3 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    this one is very aesthetic, do you have a github? :)

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

tourist is the only tourist that remains a tourist even when he's in his country.

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

Hi everyone!

I just woke up and I have accepted some of the facts you guys suggested.

Huge thanks to everyone involved. I've seen a lot of hilarious facts there!

One thing to note: if you have a fact suggestion that you want to appear in the page, submit it using the link on the blog! If you only state a fact on the comments of the blog and you don't create an issue it won't appear on the page, and if someone submits that on your place, you won't receive credit for it.

I've tried to make the process of submitting facts as easy as I could so everyone could take part if they want :)

Happy contributing!

→ Reply
»
3 years ago, # |
← Rev. 2   Vote: I like it +55 Vote: I do not like it

Even tho I feel old doing this, but I leave it here:
Edit: apparently contains racist content, don't read if you're sensitive

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

Tourist can iterate over all permutations of size $$$N$$$ in $$$\displaystyle \mathcal{O}(\frac{1}{N!^{N!^{N! ^{\dots \infty}}}})$$$ time.

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

    I know this isn't much related to the blog but

    Seriously, what's the real complexity of finding the next permutation?

    Is it O(n) like we just need to find a decreasing element ie Ai<Aj and after that Ai should be replaced with the immediate larger element from the last till Aj.

    So one traversal till Jth index and another separate traversal to find larger element .

    So isn't it O(n) for one permutation? And there are n! permutations .

    Hence O(n!*n) ?

    Sorry if this is absurd.

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

      It's $$$O(1)$$$ amortized if the elements are distinct (you ckeck $$$2$$$ indices on average for each call)

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

His brain charges my computer

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

"Tourist knows the Nim value of any chess position." is extra funny since chess isn't even an impartial game

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

I was an atheist but then I got to know about tourist

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

One more suggestion, put some react buttons. So that people can express their feelings after reading the facts.

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

tourist knows only about Black-Red Trees

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

Best project i've ever seen!

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

tourist and Zuckerberg made a bet who can be more popular. The loser has to rename their company.

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

Tourist was once asked for an interview and he got late. So he did the interview by " MEETING IN THE MIDDLE "

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

I like this :)

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

Coders start competing for the 2nd position when they see Tourist in a contest.

→ Reply
»
3 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

Tourist is man !! He worked hard for years to be what he is... did not you? tourist

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

tourist doesn't need a compiler, compiler needs him.

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

here are tourist's pro tips :)

→ Reply