« first day (177 days earlier)   

6:55 PM
Hello o/
 
@cairdcoinheringaahing CMCs or old challenges \o?
 
sure
 
CMC: Given x and y, determine the largest integer divisible by x that is less than y. x and y can be any number that isn't 0. You can assume that such a number exists
 
Ok, yeah we should do that one
Test case?
 
6:58 PM
Example: 3, 100 => 99
 
7 bytes.
 
7 bytes. Takes input reversed
 
Like 100, 3?
 
Mine does 3, 100.
Let me try 100, 3 too
 
7:00 PM
7 bytes, takes input normally
 
@cairdcoinheringaahing 6 bytes by taking the input in reverse.
Hi Hyper
 
Hello
 
[Opening tabs...] :P
[3 years later...]
 
5 bytes with argument reversed
 
7:03 PM
6 bytes using 100, 3
 
6 taking it normally
 
4 bytes, reversed.
 
3 bytes using 100, 3
 
Yeah 3 bytes... That's so obvious
 
ಠ_ಠ Do yours use ?
 
7:06 PM
We are really overcomplicating stuff oftentimes...
@cairdcoinheringaahing No.
Neither.
 
3 bytes here
 
MD5 Hash: 9720EB50AD606409704B9B9666EB97DD
 
MD5 Hash: 70E503C27C18AE643E85D296EFAAC198
 
Another 3-byter with MD5 Hash: 70E503C27C18AE643E85D296EFAAC198
 
@Mr.Xcoder Same hash as mine
FWIW, mine was :×⁹
 
7:09 PM
:×⁹ or :×⁴
My previous ones were: rọ³$ÐfṪ, ọ⁴$ÐfṪ, ọÐfṪ
 
A bit late but md5: 9720eb50ad606409704b9b9666eb97dd
 
I had ḍ@ÐfṪ
 
Mine was Rḍ@ÐfṪ and then :×⁴
 
CMC: Given a list, determine its partition with the minimum length and with all the partition sums equal (you may assume such partition exists, if there are more return the one with the least sublists)
 
@HyperNeutrino Ðf implicitly casts to range
 
7:11 PM
oh cool
 
@Mr.Xcoder Test case?
 
Making one.
 
9 bytes, md5: 376ec1ff209f2ff3a7adab4757e90339
[1, 2, 3, 4, 5, 5] -> [1, 2, 3, 4], [5, 5] (boring case)
 
> with the minimum length
 
7:14 PM
You have to return the sublist with the minimum length
 
(except from itself)
 
oh right
I was verifying against an edge case lol
 
Like [1,2,3,4] doesn't give [1,2,3,4], it gives [[1, 4], [2, 3]]
 
10 bytes, dm5: 0c5b3b7f2c3817332218d9e1936fa547
 
(the lowest number of sublists)
[5, 6, 3, 8, 2, 9] -> [[5, 6], [3, 8], [2, 9]]
 
7:16 PM
oh wait
partitions won't work lol
This is beginning to feel too long..
 
11 bytes. I think it is valid.
 
15 bytes, md5: 080cfec79f50fb41626bad92c2ef0eae
(not looking at the 11-byter yet)
 
No mine's invalid.
 
7:20 PM
o/
12 bytes here
@HyperNeutrino you still here?
 
hi
sorry was working on fixing proton bugs
o/
Since I'm losing, can I post my solution here?
 
Œ!ŒṖṖ$€ẎS€E$ÐfṪ
 
@Mr.Xcoder That's mine
 
7:25 PM
I though so too
School
tomorrow
G'nite
 
G'nite \o/ Yay for half-term holidays
 

« first day (177 days earlier)