














(edited)








































std::set provides ordered input


std::set provides ordered input 



































































































































Box type is also special


*boxed can move out of boxed













































































Yes, tail recursion is guaranteed in Rust. Tail recursion occurs when a function calls itself as the last action it performs before returning a value. This is a common technique in functional programming languages, as it allows recursive functions to be implemented in a way that is more efficient and less prone to stack overflow errors. In Rust, tail recursion is guaranteed to be optimized by the compiler, which means that recursive functions that use tail recursion will be executed efficiently and without the risk of stack overflow. This is an important property of Rust, as it allows programmers to use recursive functions without having to worry about performance or reliability issues.






become







/proc/self/mem and poke some bytes
C:\Users\ASUS\Downloads\ddrace-DDRace\ddrace-DDRace>bam server_release
configure.lua:89: attempt to call a nil value (global 'setfenv')
bam: script error (-t for more detail)
Hi guys , what is error?


C:\Users\ASUS\Downloads\ddrace-DDRace\ddrace-DDRace>bam server_release
configure.lua:89: attempt to call a nil value (global 'setfenv')
bam: script error (-t for more detail)
Hi guys , what is error? 


C:\Users\ASUS\Downloads\ddrace-DDRace\ddrace-DDRace>bam server_release
configure.lua:89: attempt to call a nil value (global 'setfenv')
bam: script error (-t for more detail)
Hi guys , what is error? 


















Why was the math book sad?
Because it had too many problems.
(I know it's not the best joke, but I'm just a text-based AI and don't have access to the internet, so I can't look up jokes for you. Sorry!)









Why was the math book sad?
Because it had too many problems.
(I know it's not the best joke, but I'm just a text-based AI and don't have access to the internet, so I can't look up jokes for you. Sorry!) 

Why was the math book sad?
Because it had too many problems.
(I know it's not the best joke, but I'm just a text-based AI and don't have access to the internet, so I can't look up jokes for you. Sorry!) 

























this AI can actually tell me how to make my stuff in Godot, while the other professionals on Godot dc cant






























55b576c Add generic confirm popup to menu, adapt generic message popup - Robyt3
dd60c84 Replace POPUP_DELETE_DEMO with generic confirmation popup - Robyt3
f4708a3 Replace POPUP_REMOVE_FRIEND with generic confirmation popup - Robyt3
620e3e5 Replace POPUP_DISCONNECT(_DUMMY) with generic confirmation popup - Robyt3
8da68bf Replace POPUP_SOUNDERROR with generic message popup - Robyt3
cb1d9cc Replace POPUP_REPLACE_VIDEO with generic confirmation popup - Robyt3
a45f833 Replace POPUP_SWITCH_SERVER with generic confirmation popup - Robyt3
9b719ef Add confirmation popup for resetting controls to defaults - Robyt3
5994812 Rename variable CurSelection to s_CurSelection - Robyt3
5903c25 Add cancel button to country popup, confirm with list item activation - Robyt3
38eaa1a Merge #6081 - bors[bot]cl_mouse_min_distance and cl_dyncam_min_distance). However, this did not consider that the x position can become negative, so the x position was also incorrectly changed when exiting...


import Data.Char
import Data.List
prio c | c >= 'a' = ord c - ord 'a' + 1 | otherwise = ord c - ord 'A' + 27
slice (x:y:z:xs) = (x,y,z) : slice xs
slice [] = []
main = do
ls <- readFile "day03.in"
-- Part 1
print $ sum . map (\l -> (prio . head . uncurry intersect) $ splitAt (length l `div` 2) l) $ lines ls
-- Part 2
print $ sum . map (\(x,y,z) -> prio $ head $ intersect x (intersect y z)) $ slice $ lines ls