How long do you usually last on this website?
I usually do 7-10 days and then I get bored or filtered. And as almost all of my coworkers kind of drop it, I've got no incentive to keep pushing. And they probably think the same lol
What about you guys? Ever finished one or at least gone deep into one?
And have you ever suspected someone of cheating by the way?
 It's All Fucked Shirt $22.14 |
 |
It's All Fucked Shirt $22.14 |
I did 2022 and 2023 in Rust and it worked out quite alright. I did 22/23, missing a day or two for some really tough challenges with cubic scaling etc. It's just extremely time consuming and you don't always have the time, so it's understandable that when you hit a day where you're three hours in on part 1 that you'd give up, and not be motivated to go again the day after. Life comes first, rest is diligence.
ggs chads
Sometimes I just go too hard.
are you the guy coding for the NES? i remember your vids on the thread, they were so awesome man
usually by day 4 its too hard to prompt the right answer so I quit instead of wasting time
>What about you guys? Ever finished one or at least gone deep into one?
50 stars on 5 of 7 years since 2017, and the two I stopped were between 10 and 20 days.
>And have you ever suspected someone of cheating by the way?
It's pretty obvious when someone has only a few seconds between solving each part. Some have claimed they have a separate accounts for work and IQfy, but it's a giveaway when it happens *only* on the harder days.
A lot of the same concepts are reused in puzzles for different years. if you completed previous years AoC challenges, it's likely much of that code can be reused with only minimal tweaking.
idgaf about leaderboards anyway, I only use it as a way to force myself to learn a new programming language.
Been too busy with work and university to actually do any for the last couple of years. Was fun back in highschool tho
How do people even find time for this?
We just solve quickly. I can crank out a couple of stars per day before bed even in the later parts.
Maybe you’re just bad?
>How do people even find time for this?
by not caring about anything else.
I literally ignored so many emails and teams messages for 2023 because AoC completion is literally more important to me.
frick wage and frick wagies.
I started in the middle of December last year, done over 200 stars now. All in C++.
I got to day 14, then there was a big storm, and I was out of power for 12 days. So I lost motivation
>then there was a big storm, and I was out of power for 12 days.
Nice larp and cover story you got there, chud.
When I got to Day 3 I had a massive shart during our Officce Enchilada Evening, and after that I lost all motivation.
Grim.
I'm sorry to hear that....... but you got filtered.
NO! IT WAS THE ENCHILADA AND MY BUTT! NOT ME!
Were you able to keep your squat plug in at least?
No, it shot out like a cannonball and hit Rosie from HR straight in the face.
https://globalnews.ca/news/10189935/blackout-christmas-about-1300-in-n-b-still-in-dark-nearly-a-week-after-storm/
Okay, hmm, I see. Apologies for my acquisition, then. Can't the power cables be made underground to combat this?
>acquisition
>1. an asset or object bought or obtained, typically by a library or museum.
>2. the learning or developing of a skill, habit, or quality.
*accusation
I live in the middle of the woods. I'm lucky of the power company, even remembers I'm there
Are you like the lawnmower guy in True Detective Season 1?
>zoomers get burned out on IQfy and need breaks
fricking LOL
zoomer weakmind strikes again
About 10-15 days in.
I use BQN and at some point challenges become less fun to tackle in a ln array language and I move to different projects.
People choose to do AoC in new languages as an excuse to fail and drop off.
>No I’m not stupid, I just had to write it in OCaml for teh memes and that takes time for me
>Listen here, I’m not dumb. I know how to solve these tasks, I’m just struggling with the paradigm and language
>Switch to my prefered language? Aw, geez, well, look at the time. I have so much to do you know? I have that game I’m developing. Yeah, yeah, it’s going great. I’ll have a demo up soon, just need to tweak some stuff
>No, it’s closed source
>Not really looking for testers now, sorry
I am taking part in AoC for fun, I don't need to prove anything.
to my prefered language? Aw, geez, well, look at the time. I have so much to do you know? I have that game I’m developing. Yeah, yeah, it’s going great. I’ll have a demo up soon, just need to tweak some stuff
>>No, it’s closed source
>>Not really looking for testers now, sorry
So much projections.
During last AoC I wrote an online editor that I and some other people used for AoC. As fun as some of the days are, at some point it becomes a chore and doing something more practical seems like a better use of time. Not everything has to be turbo competitive.
>P-projections
I find AoC easy to medium in difficulty. How many years have you completed?
> I did it this year in Go, to learn the language, so I have some tangible benefit from investing about a workweek's worth of coding time
Good for you. And of course you only stopped because you got what you wanted out of it and not because you got filtered by Day 8 part 2.
That's a dumb take. I did it this year in Go, to learn the language, so I have some tangible benefit from investing about a workweek's worth of coding time
2-3 years ago finished until day 20-something, then dropped it completely and skipped following years
dropped it because it's "programming" but not in the direction i would like to have been challenged - it's all just mathgay algorithms rather than some intelligent software design
>intelligent software design
Let me guess, ”clean code”, abstractions and SOLID principles?
>Let me guess, ”clean code”, abstractions and SOLID principles?
this reply is based. it's based because "intelligent software design" is a subjective meme on the same level of economics and psychology.
thank you for calling it out.
There is nothing subjective about it
>does it work
>does it keep working
>can other people add features to it
It doesn't matter which principles you prefer, but there is such a thing as shit software design.
Anon... SOLID and "Clean Code" is shit software design.
I've literally never seen a project where you can have your cake and eat it too. There is always a "frick you" somewhere.
Perhaps not being moronic reduces this, but I've never seen an actual practice that gets you that state.
As opposed to what? You want problems asking you to design a website for the elves?
>Santa has built a working program that helps him deliver all the presents on time
>But an elf consultant has informed him that his solution is not according to the enterprise standard.
>Santa is satisfied with his program and doesn’t want to listen, so the elf consultant has asked for your help to bypass his decisions.
>There are only 25 days until Christmas and in that time you need to
>Introduce a SAFe organization with proper release trains that will be working on a cadence of 6 sprints with two weeks a sprint, with the last sprint being an innovation sprint
>Rewrite his software in Java with proper enterprise quality abstractions following the SOLID principles
>Introduce a common CI pipeline and test framewlrn to make delivering and testing software more effective
>Train every elf in agile self-ownership and implement cross domain community platforms where elves can share their opinions on how to make Christmas even better
>Create a company wide portfolio that will show investors and clients how you can help them collaborate on future products together
>But you need to hurry up! The clock is ticking! You need to collect 50 H1B visas before christmas day in order to properly ruin christmas forever
I did it twice back to back, once in 2021 once in 23.
We have a competition in the workplace and I don't wanna be seen as a brainlet.
I was filtered by day 12 and I am still crying
It's ok, anon. I got filtered like on day 6.
Don’t worry. Janitors are always in demand
Codeforces is better
i did every day from 2022 and 2023 tho
3 days
I work as an embedded dev so programming isn't my forte anyway, although I'm getting very good at writing reusable/modular code these days.
Funnily enough, I'm getting worse at writing "clever" or highly complex code.
>Funnily enough, I'm getting worse at writing "clever" or highly complex code.
Vaxx status?
Last year I had to look up hints for two days I think. Made it to the end
I'm doing some problems there for fun right now and man the wording is SO AWFUL. Idk if I get filtered because I'm a ESL peasant, but I find the instructions so unclear, it's terrible. I take too much time just trying to decipher what the problem wants me to do.
From the get-go the exercises are convoluted and it's nice but man the creator really can't write.
>IQfy and not advent of code
it's not adhd it's moronation
about 23 days and 12 hours. you are defeated not when you are filtered, but when you give up.
You’re missing a few stars there, bud.
I go until I get busy on a weekend and then cant be assed to catch up.
Did the first day of this last year in asm, got stuck on the second part, realized it served no actually useful purpose and gave up to work on something meaningful.
It only exists because webdevs and scriptkiddies need to feel good about their meme languages and day jobs. There is quite literally no use in making any of the solutions hyper-fast, so all you're doing is training yourself to cobble together shit code that barely works for the half second you need it to. It is not just a waste of time, it is anti-productive.
you have no sovl
Let me guess: you think good code follows the SOLID principles and don’t get why people say that OOP is bad.
I barely started learning ASM last year, how did you get stuck on day 1?
I even got my solution out within the day.
When I look at solutions on reddit, I sometimes see people using the same algorithms as others', with even the same variable names, just in different languages... why would they do that
What? Do you invent a new sorting algorithm and memory allocator every time you program?
This guy speaks the truth. Honestly, it’s ok to be filtered. But not to make excuses.
Believe it or not some people have jobs that don't afford a lot of free time to play.
Strange. I have a job and not a lot of free time. And still I manage to clear a year in a week or so with ease. Makes ya think. Or, well, perhaps not you because you’re a filtered tard.
Usually I use my vacation time to take my wife and kids somewhere I want to visit. What does your wife think of AoC? Do your kids do it too?
My wife thinks that it is fun that I'm having fun. No kids yet.
sounds like a problem
>a lot of free time
anon there are 24 hours in a day and you work only a third of that
that's why you wake up early to read the problem and think about it at work
>wake up an hour earlier than usual
>do the thing
>shitpost a bit in /aocg/
>jerk off
>go to work
>shitpost in /aocg/
>lunch
>shitpost a bit in /aocg/
>go home
>shitpost a bit in /aocg/
>sleep
>goto 10
Yeah, wage cucks.
I do every single day, on the day. There have been only a few that take me more than a day.
I've done all of the last 3 years, except for the assembly reverse engineering one in 2021. Last year I did it in RISC-V up until day 17, at which point I switched to python.
I haven't gotten to 2021 yet, doing 2018 now, but there was a fun assembly reverse engineering as Day 23 back in 2017 as a big frick you to everyone who thought they could brute force their way through. It filtered people.
I last for 25 days
I made it to 20+ one year before getting filtered. I didn't even participate last year because I had a kid and 2 jobs. I always say I'm gonna go back and do them all but yeah right
What I never understood about these threads is the people that have to announce some excuse why they can't do it. It's IQfy, an anonymous image board. literally no one will know. Just admit you got filtered already.
People don't want to admit that they are imposters. But they are. And soon you will be found out. Perhaps they already know, perhaps when they look at you they see a big phony. A fake. Someone who doesn't belong.
based? but it still makes no sense to me. no one fricking cares. maybe when IQfy becomes Reddit 2.0, it will matter, but even in Reddit-tier world, you'd just.... not participate.
It's annoying even this year how many shitters kept proudly announcing their ignorance and ragie wagie bullshit.
Filtered IMO means not making it to the top of the leaderboard. All of IQfy is filtered except 1 or 2 guys.
Oh, you can do challenges slightly harder than fizzbuzz in a non competitive time? Big fricking deal, you are less "filtered" than the bottom half of the unemployed NEET losers on here, hooray!
I guess that's why it appeals to so many people on here. If you never got paid to program, you need something to prove to yourself that you are better than those "wagies" and "a real programmer".
No one cares about your opinion.
Your choice to define "filtered" in a way no one else does is just another coping mechanism.
>sligtly harder FizzBuzz
Oho, no challenge you say? Well, let's see if you are all talk or can code the code as well.
This is a puzzle from Advent of Code. Given the list of numbers below, divide them into four groups of equal sum. Find the smallest group possible, and if two or more groups of equal smallest size exists, find the one with the smallest product of all numbers in the group.
Return the product of all numbers of the smallest possible group with the smallest product.
1
2
3
7
11
13
17
19
23
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
101
103
107
109
113
Post code.
Should be easy, right?
Funny. Thread died. Guess it wasn't just a slightly harder FizzBuzz after all.
Sum the numbers and divide by 4. 1560 / 4 = 390.
Use as many numbers possible to reach 780. Divide the rest (least) in two groups of equal sum 390 and find the smallest.
That's how I would do it.
What if the group that adds to 780 can't be divided into two 390 groups?
This looks like a 4sum problem to me, and you just have to realize that going from 3 to 4sum is just adding another round (and if you need to go to 5sum, just keep adding more rounds).
Just do an exhaustive search for a sum to 390. 2^29, it's nothing.
I quickly did a solution using the combinations iterable. Just loop starting from 2 for the size of the groups and when you get some results you have the smallest group size, then you prod the results for the lowest product.
Lol. I don't have to prove shit to you, homosexual. I posted that in the shitter after work. Then I went running for 2 hours, lifted weights and had online classes. Then I ate and went to sleep.
Not everybody is a NEET who has all the time in the world to prove themselves to random morons on the internet.
What have you done in the meantime? Seething in this thread?
I will solve it in the afternoon or tomorrow if the thread is still up.
>I will solve it in the afternoon or tomorrow if the thread is still up.
Oh, don’t worry. I’ll keep the thread alive until then.
Now, since you gave me a challenge it's only fair that I give you a challenge back.
Can any of you AoC shitters solve a non trivial problem?
Every Israeli national is assigned an ID number at birth. The number consists of 8 digits plus an additional check digit.
The algorithm to calculate the check digit is as follows:
You start off by multiplying x2 every other number starting from the second number. If there is a remainder, add it together ie; 7*2=14=1+4=5. Now add up all 9 digits together. If the sum is divisible by 10, it is a valid ID number.
For example, the following are valid Israeli ID numbers:
255345345
945234567
890785234
The following ones are not:
123908785
456098238
234786673
Your task is to find a regex that only matches valid ID numbers. The regex must be under 1 MB in length and work with at least one regex engine on regex101.com.
dumb moron
filtered
your instructions are incomplete or wrong.
e.g.
jew_mark_of_the_beast_validator("255345345")
false
5 - 1
3 - 6
5 - 1
4 - 8
275
the number isn't divisible by 10 obviously.
Yeah, sorry, in my defence I got the examples from here https://www.protecto.ai/blog/israel-national-id-download-sample-data-for-testing but apparently they are wrong.
Here is a valid example: 087451464
Here is an invalid example: 087451466
I got both the algorithm and the example from here: https://forums.dansdeals.com/index.php?topic=24176.0
But I must ask what you are expecting. You can't do algorithm checks in a regexp. Like, you can't check if a sequence of numbers follows the Luhn algorithm in a regexp. You could potentially make a very long regexp that would include all different combinations that you'd validate, but this check is more easily done in code and not in a regexp anyway.
Is this what you are looking for? Just a big regexp that checks against all valid combinations?
>Is this what you are looking for? Just a big regexp that checks against all valid combinations?
probably. given how luhn works it should be doable, but you'd probably want to write a program to emit the regexp.
That would be the absolutely most stupid way to solve a problem. I mean, many puzzles in AoC are contrived because of the unrealistic scenario. But this is just a bad solution to a realistic problem.
yes. I agree. one of the reasons I like AoC is it does not command you how to solve problems. It's beautiful. I see a shitty "leetcode" which, yet again, says thall shalt mutate the input (or not) and wonder, why do they care? your shitty test harness is not *my* problem, imo. Doesn't help that most their solutions aren't any better than dfs/bfs objectively in benchmarking. I like AoC because ultimately, you either get the right answer and feel satisfied you solved it realistically as a programming problem, or you Black person-rigged it to work but still solved it, i guess.
>or you Black person-rigged it to work but still solved it, i guess.
That was me.
based. by Black person-rigged, I meant more like 2023 where people were basically drawing their inputs with force directed graph drawers and then modifying their programs to fit their inputs.
e.g. 2023, day 25.
Don't you dare call this work of beauty Black person rigging.
>people were basically drawing their inputs with force directed graph drawers and then modifying their programs to fit their inputs.
Wait, you're serious? That is some funny shit.
>Wait, you're serious? That is some funny shit.
yes. for day 25, I saw people showing they just used graphviz with -Kneato and just hardcoded the 3-pair "wires."
I want to add, I'm mildly miffed by it, but I respect the problem solving and understanding how force graph drawings would work.
Yes, agree. And oh man, I loved 2023, especially Day 5 part 2 because of all the Black person rigging. My code is like ok-ish speedwise taking < 40 ms to solve both parts. But I had a guy at work who just ran his code, went to bed, and hoped for a good result when he woke up. I think he had an execution time of like 5 hours or so for part 2.
How come on anon, don't tell me you were filtered by regex.
You can, I've done it. The regex ended up being just above 100 KB.
But you have to be clever. If you simply listed all possible correct numbers it'd be many GB long.
You might say in the real world you wouldn't use a regex, but you wouldn't need to find the groups that add up to the lowest possible sum either.
Ok, hmm.
I would assume then that you'd be counting the number of digits to see if they add up to 9. Then you'd split the digits into pairs to include positions and for every case match against what would complete it. So if you find a 1 in an even index you'd match to see if you can find a 9, or a 1 and a 8, two 1 and a 7 etc. and do the same of all numbers. And, of course, 0 is always zero, 9 is always 9. The rest vary depending on where in the pair they are located.
Something like that?
The way I did it is with backreferences. So for each digit I'd have 10 different cases, and for each digit chain each case with the previous one that would cause it to match.
The problem is contrived but it could theoretically happen in reality. For example you have a web app that only takes regex and you can't change the code running on the server. In that case making the regex would be the most straightforward solution.
>backreferences
not a regular expression then
dumb moron
Filtered.
If you’re a regexpert, I have a question. Like I said earlier I don’t know regex, but I tried it once coincidentally for AoC. Basically I had a huge JSON where I wanted to filter out every object that had a certain property, including any nested datastructures in the object. Easy enough. The problem was the nesting. Sure I could have easily hardcoded the deepest nesting depth in the regex but I wanted to solve it dynamically in the regex itself. (Like sure, I could have written a function that would generate a regex that would work, but I didn’t want to do that as then I might as well solve the problem without using regex which I ended up doing).
Do you know if it is possible to do this, to write a regex that is able to handle every level of nesting without it becoming a horrible and slow mess?
it's not possible. JSON is not a regular language.
https://en.wikipedia.org/wiki/Regular_expression#Formal_language_theory
https://en.wikipedia.org/wiki/Pumping_lemma_for_context-free_languages
Thank you!
It's not possible. A regular expression is basically a state machine. Parsing arbitrarily nested structures requires potentially infinite memory.
Now, backreference make regular expressions technically not a regular language. With backreferences the power of regex becomes equal to an LBA, but an LBA has finite memory so it still is too limited to remember the nesting level of an arbitrary JSON.
If I had a problem that would need to be solved by finding said group, then yes I would do it. There is a difference between contrived problems and stupid solutions.
Damn, I kinda want to see your 100kB regex and then code a solution in 6502 ASM to benchmark.
Wouldn't be surprised if my Famicom beats it because it would be very easy to code.
I believe your Famicom would beat it easily.
I mean that's probably true for any regex.
Array.from("087451464", Number).reduce((kek, n, i) => kek + (n * ((i % 2) + 1)) % 9) % 10 === 0
filtered
Haven't learnt RegExp, but yeah why not. Always fun to learn something new. Post your answer to my question first, and then I will post my answer to your question.
But you better check your examples again because none of those are valid ID numbers.
Check for yourself: https://planetcalc.com/2464/
>Your task is to find a regex that only matches valid ID numbers.
Regex is gay, but the algorithm is simple.
1 -> 2
2 -> 4
3 -> 6
4 -> 8
5 -> 1
6 -> 3
7 -> 5
8 -> 7
9 -> 9
So you just do that replacement on the 2nd, 4th, 6th and 8th digits and then sum and check if the final digit in the sum is a 0.
Yeah, I wonder about what part of this is non-trivial. Writing a regex that validates if a sequence of numbers with Luhn is impossible. Writing a regex with all different valid sequences is trivial but takes fricking forever unless you write code to give you the regex. And writing code to validate is trivial.
I think that he is just mad because he can't solve
Filtered.
Now that I have solved it conceptually, I'll just leave it for an Indian to implement for me.
bump because is easy and I'll do it when I get home
Do you know?
local function combine(a, b)
local c = {}
for i = 0, 9 do c[i] = {} end
for i = 0, 9 do
for j = 0, 9 do
table.insert(c[(i + j) % 10], a[i] .. b[j])
end
end
for i = 0, 9 do
c[i] = '(' .. table.concat(c[i], '|') .. ')'
end
return c
end
local oneA, oneB = {}, {}
for i = 0, 9 do
oneA[i] = i
oneB[2 * i < 10 and 2 * i or 2 * i - 9] = i
end
local two = combine(oneA, oneB)
local four = combine(two, two)
local eight = combine(four, four)
local regex = {}
for i = 0, 9 do
table.insert(regex, eight[i] .. (10 - i) % 10)
end
regex = table.concat(regex, '|')
print(regex)
Very easy with these bounds, 126KB without any smart ideas or backreferences.
Thinking about this again, an easy optimization brings the size down to 42KB.
All that is left then is for Mr. Regex who was definitively not filtered and will definitively solve my problem to actually post a solution for
You can write code that generates the regex and that isn't cheating?
The post asked to find the regex. How you find it isn't any of my business.
Nice, I didn't think anybody would come through. What language is that? regex101 lets you share expressions, send the link.
I did most of it already, will finish once I get home.
Looking forward to it
Here is a program that searches for a solution that meets the criteria:
https://pastebin.com/8tWxNdc7
It looks like it would take like 10 hours to search the whole solution space. I'm not gonna bother letting it run though because I am skeptical that this is actually from AoC or even actually solvable.
According to this algorithm
https://www.geeksforgeeks.org/partition-set-k-subsets-equal-sum/ there is no way to partition the set into 4 bins of equal sum.
If this is indeed fake then good job, you just proved my point that AoC is for brainlets.
>can't solve the problem
brainlet
I am not going to work more on the problem. If there is a solution and the problem is actually from AoC then post it and I'll admit I'm a filtered brainlet. Otherwise if you let the thread archive without posting a solution then AoC shitters are confirmed low IQ trolls.
Here you can find part 1. You will not have the same input as me, but similar enough.
https://adventofcode.com/2015/day/24
Kek. I forgot how 2015 had like 3 of these kinds of problems.
2015 was a fun year
wrong
Ok, ok, 2015 was a terrible year. 2017 was a fun year.
2016 was fricking terrible with all the asmbunny tasks that managed to be both braindead easy and hour long ventures if you snuck in a bug somewhere by mistake.
Day 11 2016 was GOAT though
Fricking IQfy I swear to FRICKING CHRIST
It was ok. My biggest gripe was day 19 which had the obnoxious chemistry bullshit with the non-chomsky normal form production rules so it made it exceedingly bullshit to parse it like with CYK or whatever grammar recognizer algos. After spending 6 hours I realized how fricking stupid easy it was when I realized all that ultimately mattered was a fricking number.
Yeah, I feel you on Day 19. I realized quickly what I had to do after studying the input, discarded that idea and then spent hours trying to shrink the molecule back to e. I did like the RPG tasks though
Still waiting for you to say that you’re a filtered brainlet.
You didn't post the solution. What is the smallest group that divides them into 4 groups of equal sum with the input data you gave?
cope, multiple solutions have been posted in this thread.
I have achieved both stars with mine.
nice self doxx anon
t. eric
there are only a couple of different inputs
embarrassing
So there is no solution, got it. Nice to know AoC shitters need to change their problems until there is literally is no solution and then pretend they're smart for solving the original problem.
The solution is literally what is in the picture: 80393059. If you were a half decent programmer you’d know this.
No, post the answer with the "input data" that you gave on this thread.
Dude, this feels so weird because we have the same input. I recognize those numbers
Imagine being this desperate. You have several people IIT posting their solution, and me who gave you the problem. And then you can also find loads more solutions on Reddit in the dedicated thread.
But I guess that the 10h gay is too stupid to realize that he has already outed himself as a moron
Then all you have to do to prove me wrong is post the output of one of those programs.
https://play.rust-lang.org/?version=stable&mode=release&edition=2021&gist=a060e9faac519a4e14771286a4fd034b
Not good enough! How do I know that you don’t own that website and has hardcoded the response to this input?
Samegay. It says "[11846773891, 80393059]".
Your post didn't ask for whatever that is. You still haven't posted a solution.
I honestly can’t tell if you’re the filtered moron or if we are all just shitposting pretending to be him
A solution to the problem you posted in this thread would be something like a={1,2,3] b={4,5,6} c={7,8,9} d={10,11,12}.
Not "[11846773891, 80393059]"
>Return the product of all numbers of the smallest possible group with the smallest product.
Funny thing is that this is also trivial to find from the posted code, but completely impossible for the filtered tard. Because he can’t code.
Still waiting for you to admit that you’re a filtered brainlet
I'm trying to modify your Rust solution to be able to output the numbers used to calculate the product but I haven't been able to.
If you can post the groups used to calculate the product then I'll admit I'm a brainlet.
lmao, have a nice day
Umm no
Because otherwise I can't be sure that the problem actually has a solution.
Lol. Keep struggling, brainlet. Next you’re going to accuse the compiler of being in on it too and only admit your tardness when you can translate the code to fricking 0s and 1s yourself.
Here is your fricking group, brainlet:
{61,107,109,113}
Finding a single group that adds up to 390 is easy. What about the other three groups?
Ok.
{61,107,109,113}, {1,19,83,89,97,101}, {41,59,67,71,73,79},{2,3,7,11,13,17,23,31,37,43,47,53,103}.
There you go, did it all in my head. Easy for someone who isn’t a brainlet.
Alright, fair enough, I was wrong and you were right. I'm a filtered brainlet.
I’m not the Rust guy, but it should be easy enough for a semi-new beginner to do. But why? That is not the question I gave you. I literally asked for the product.
It is from AoC, Year 2015 Day 24 Part 2 to be specific. And my code takes approx 20 ms to solve it. In Part 1 you split them into three groups instead, and my code takes approx 0.1-0.2 s to solve both parts.
>it's day 24 part 2
Good enough for AoC, good enough for me.
Result and execution time? I can't check your code myself, sorry.
6-7ms using the time module to time it for part 2.
~80ms for part 1.
Nice! Much quicker than me. Are you running this with my input or have you taken these stars in AoC yourself?
That is my AoC solution, and it looks like the same input.
Well, my code is a bit slow like I said, 0.1-0.2 s in C++ for both parts. But in my defence I’m actually a manager. Don’t want to show it because it could dox me, but the basic gist of it is two recursive functions with one trying to find the smallest group with the smallest product, and when it has found a candidate it runs another recursive function on the numbers that are left to try to determine if the numbers that are left can be split into three groups.
It can definitively be optimized further, but it works.
Lua https://regex101.com/r/Hy6GXl/1
I feel like this moron just accidentally ran into his own definition of "filtered" and doesn't realize it.
I never claimed not to. My whole point was if I could rank top 10 I would do them.
Do you have reading comprehension issues, moron?
>I am coping
so just like my original reply, no one asked or cares. can you really not solve:
?
it looks like stars and bars and it's easy. 3 bars. 4 groups.
I was in the shower, Black person. Now I'm off to work. I'll give it a go at night.
>I literally ran from the problem, I'm not a fraud, a talentless fake, I'm just busy!!!
You're mediocre. You don't solve hard problems, you cheaply implement other people's solutions so your boss doesn't have to pay that other, better, talented guy for his work.
It's fine, you're a cog, an expendable, replaceable, cog. Machines need cogs.
Just don't ever in your life pretend you're doing anything to solve the real problems. You're quite literally the job they're looking to automate away, the code monkey, the low effort scrounger.
idiomatic Rust solution
Result and execution time? Sorry, don't have time to copy the code by hand to try it out myself.
oops, wrong solution. real idiomatic Rust solution here.
takes 6 ms for both parts in the Rust playground.
Nice. My input or yours? Like, I can't read neither this solution nor the other one and just from the code state that they work because I'm not familiar with neither rust nor javascript(?). Like, they look right, but I can't tell without looking at the results because I might just be fooling myself. Especially the javascript, no idea what combinations does.
Try it in rustplayground, it's like godbolt for rust
Writing huge function with multiple nested lambdas with imperative code randomly mixed in is not idiomatic in any way. This is just moronic.
Either write it in functional style or split it into multiple imperative functions.
dumb moron. I have over 10 years of Rust experience. see
for peak idiomatic Rust code.
appeal to authority
appeal to idiomaticity
See, this is why no one likes Rust. Whenever one of their priests comes and start proselytizing he will soon be joined by another priest from the same fricking church calling him a moronic shitter. And then they start wrestling on the muddy ground.
>nobody like Rust because one anon writes Rust in a style not to the liking of another anon
This is actually a problem. Rust won’t spread if the only Rust code people come in contact with is moronic and don’t adhere to the Rust idioms. It is not supposed to be just safe Cnile code.
people don't come into contact with Rust on IQfy. only dumb morons come here.
Yeah, but the same programmers will come in contact with others elsewhere. We can’t have people trying to market Rust with fricking behemoth code, Rust is hard enough as it is to get into
It's a bit dense for my taste but I don't see a problem with the mixing
It's hard to read. Splitting it into few functions and using for loop or two would make the code much more readable. When you are nesting multi statement anonymous functions with side effects, it's probably time to refactor your code.
I'm not against this code, but the unreachable!() in a case that can happen rubs me the wrong way.
I live in America/New_York and I'm not staying up til midnight. I do them in like 10 to 30 minutes.
cope Black person.
So what's the point of doing them the day after? Circlejerking with other NEETs about how you are a real programmer for solving toy problems using some obscure language?
I've never done it. I will never be competitive with the top 10 of the leaderboard so what's the point? I can do thousands of leetcode challenges at my own leasure.
Plus in my south american shithole it drops at like 2am.
I do hate that it shows up in the catalog for 2 months before the actual thing begins.
>I've never done it. I will never be competitive with the top 10 of the leaderboard so what's the point?
Filtered take.
Lol. Yeah, because I never cared to try doing it it means I am "filtered" and you are a better programmer than me, despite you only ever engaging in recreational programming and never in anything used by other people.
Maximum filter cope.
Your entire county doesn't understand why you put the wires INSIDE the walls, of course you won't get why you'd do something you find hard in order to get better at it.
I stop after day 1
Wow, what happened? Lost your nerve once an actual AoC coding challenge was posted? Anybody who was definitively not filtered who can prove his skill? I mean, it is just one single start out of 50. So it should be easy, right?
I know that you all have very busy schedules, what with you browsing IQfy and all, but one little star can't steal that much time, right?
Checked and where is the filtered gay now. Also like doing more important stuff like writing code for personal projects, solving real world problems or money making endeavors
What’s that smell? Is that… curry and feces? Am I surrounded by streetshitters who can’t even solve a single star?
I go until I go on holiday and no longer have a computer and have better things to do with me time.
Code? Execution time?
mine
?
Just typed it up again (seeing I did it at work on my laptop).
4-5ms.
result?
Actually, I had a dumb because I fell into the trap that I pointed out in
Because I'm not taking the remaining numbers into account. If I can't make three other groups with the remaining numbers that each equal 390 then my result is wrong.
I made it to day 17 when I was fricking 14 years old so if you ever got filtered before that as an adult you're a SHITTER
i'm happy as long as i make it more than 10 days in. i give up when i drop off the IQfy leaderboard though
Finished all 25 the last 3 years.
Funnily enough, I thought your question was asking about IQfy, which I would say I only spend a couple hours a month here except during AoC. It’s the only fun time of the year to be on IQfy. I look forward to it every year.
i dont even start
What year did you find to be the most fun?