Programmer's version of how to win a girl's heart. Let's propose our coding crushes.
Gather enough courage and open up to a girl here. See what they have to say about it.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.11.2024 05:13:22 (h2).
Десктопная версия, переключиться на мобильную.
При поддержке
blackhatinside will you be my friend? I've sent you DM please reply
Simp
This is just a specific case of Dijkstra's algorithm. Write it up and then as input, add 2 nodes. The first node — also the root — is "current state — programmer". and the second node being — "target state — having a girlfriend". Next, notice the lack of edges.
Orz to your sense of humor :P
My code is showing TLE on this line.
I developed a very fast algorithm that can get you a girlfriend in O(N).Here is the paper with the full proof of how it works
Lol you weren't able to rickroll me cause there was an ad before the vid started. #disable add blocker
Straightforward brute force. And after that you will get nothing but an anime waifu.
Rank push algorithm to get Red. More details here : https://www.youtube.com/watch?v=y7169jEvb-Y
It doesn't work :(
KMP = 看毛片 = watch porn (in Chinese)
Be aware of the risk
Like what? 114514
Isn't it NP-hard?
More like PP-hard
DICKstra algorithm
https://sort-me.org/tasks/34?archive=1&hidesolved=1&category=0
What algorithm do you use to gather confidence to talk to crush?(asking for a friend)
seems like asking for yourself in the name of friend xd
:runaway:
I have already got one
Simply there is no path
There is a book on this topic. The pre-computation is O(n), but the algorithm runs in O(logn). It describes a fast way of getting a girlfriend, but you may have to lower your standards, as looking for the best girl might result in Segmentation fault and the OS will kill your program.
Pretty sure, no matter how lower you put your standards, finding a girl will always return a NullPointerException :p
Use WFS (Wife First Search)
now I know why Salmon Bhoi is still single. Coz he didn't take his DSA classes seriously XD
Who's that
Lol, you just need to be yourself