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!
Haha, So funny
heuheuehue
omg that's amazing lol
It's his final year project.
This is why programmers eat hashbrowns from McDonalds.
Hehe.. Boi !!!
Auto comment: topic has been updated by nitor (previous revision, new revision, compare).
Tourist can get accepted verdicts without even typing the code.
Tourist can code without even reading the problem statement.
Because he has taken the red pill instead of the blue one.
Tourist can write and submit code in his mind and get accepted in Codeforces web.
It was really funny..
tourist, reaction video?
Authors panic about the correctness of their model solutions when tourist gets WA.
That's funny because it's true: that actually happened: https://codeforces.me/blog/entry/84056?#comment-714979
hahahah, I liked that one, do you have a GitHub?
Really funny.
I eat tourist in a treap:(
When Tourist was in sixth grade won his first medal on IOI.
When tourist was 6 years old he solved his first programming problem
When tourist was 0 years old he was born
Tourist fact : Tourist wakes up with 98754304948703559407 pings on cf everyday.
Btw fun project. Loved it ^_^
If tourist loses red rating then Codeforces will literally go down.
https://codeforces.me/blog/entry/18825?#comment-237943
I like the true tourist facts more so here's another one:
The probability of him losing to a 3000 rated LGM is the same as the probability of a GM losing to a specialist.
Stolen from this comment: https://codeforces.me/blog/entry/93211?#comment-821099
And another true fact:
Tourist once got to 4126 rating by beating himself.
Source: https://codeforces.me/blog/entry/44214
wow, impressive stuff :)
Tourist facts: System testing is done so as to recheck the solutions of participants against tourist's code!
Tourist doesn't need viagra. He's always NP-Hard.
If tourist marries a pupil their child (with their average rating), would still be a Grand Master.
Tourist doesn't even need a keyboard to write code. The code writes itself, under the force of tourist's mind.
video proof
When tourist get a wrong answer verdict, the author apologizes for creating wrong test cases.
Tourist's favourite music is segment tree beats.
this one is very aesthetic, do you have a github? :)
tourist is the only tourist that remains a tourist even when he's in his country.
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!
Even tho I feel old doing this, but I leave it here:
Edit: apparently contains racist content, don't read if you're sensitive
HEY! #30 is very racist.
Tourist can iterate over all permutations of size $$$N$$$ in $$$\displaystyle \mathcal{O}(\frac{1}{N!^{N!^{N! ^{\dots \infty}}}})$$$ time.
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.
It's $$$O(1)$$$ amortized if the elements are distinct (you ckeck $$$2$$$ indices on average for each call)
His brain charges my computer
"Tourist knows the Nim value of any chess position." is extra funny since chess isn't even an impartial game
I was an atheist but then I got to know about tourist
One more suggestion, put some react buttons. So that people can express their feelings after reading the facts.
tourist knows only about Black-Red Trees
Best project i've ever seen!
tourist and Zuckerberg made a bet who can be more popular. The loser has to rename their company.
Mark Zuckerberg did topcoder when he was in college: https://www.topcoder.com/members/mzuckerberg/details/?track=DATA_SCIENCE&subTrack=SRM
Tourist's min rating (1200) is higher than zuckerberg's max rating (1081)
Tourist was once asked for an interview and he got late. So he did the interview by " MEETING IN THE MIDDLE "
I like this :)
Coders start competing for the 2nd position when they see Tourist in a contest.
Tourist is man !! He worked hard for years to be what he is... did not you? tourist
tourist doesn't need a compiler, compiler needs him.
here are tourist's pro tips :)