Given a number being the product of two primes, decompose it into the two primes in polynomial time if possible(currently whether or not is unknown).
Proof is required. Shortest code win.
The next OEIS sequence in the OEIS answer-chaining challenge actually looks more solvable than some of the other crazy BS I've pulled off there... IDK why I gave up on it lol. I thought it was a lot harder than it actually is.
yes :c user202729 linked to one that I completely did not understand until about 3 minutes ago when I looked at it and my brain decided to work
the problem is I don't have programming languages left
I spent way too much time on that challenge lol (26 answers with at least like 3 of them being one-week last minute answers). Then again NieDzejkob has 41 lol
return f.read() % ("".join(featured_row %(problem_map[p]['id'],problem_map[p]['title'],problem_map[p]['ctst'],", ".join(problem_map[p]['tags']),sum(map(int,problem_map[p]['pts'].split("/"))),problem_map[p]['id']) for p in sorted(getFeaturedProblems(),key=lambda x:(sum(map(int,problem_map[x]['pts'].split("/"))),problem_map[x]['id']))),"".join(row %(problem_map[p]['id'],problem_map[p]['title'],problem_map[p]['ctst'],", ".join(problem_map[p]['tags']),sum(map(int,problem_map[p]['pts'].split("/"))),problem_map[p]['id']) for p in sorted(getProblems(),key=lambda x:(sum(map(int,problem_map[x]['pts'…
and like idk why he hates putting spaces around operators. and then when I use a double-list-comp he blames me for "code golfing". like half the time I don't even use double-list-comps in code golf
@ASCII-only yeah idk he hates operator spacing but is also inconsistent. and like the rest of the code for our server is all spaced nicely because I wrote it and I actually bothered to make the code look decent for this project
@ASCII-only I actually considered that but it's too late to go back. Over the summer if I get bored at home or during my free time at summer camp I might rewrite the whole core regardless of whether he likes it or not
I might even do it in 2 weeks because I only have 2 exams
Before that... help how can I undo some configurations that I've done on uim
@H.PWiz For the dialog way, run uim-pref-gtk. Go to "Global key binding 1" tab. Try removing the occurences of <Shift>space there to see if the problem disappears.
The "non-dialog" way is to modify ~/.uim.d/customs/custom-global-keys1.scm
Because there are too many occurences of <Shift>space I don't know which one is "correct". I (accidentally) removed them all, so I can't test.\
@ASCII-only I had used it previously because it allowed me to update keyboard configs without restarting x. I don't use it now, and have just removed it
I can't find any "ruling" about this but if I have input that is the output at the same time (like an array), after the change is done as expected, can I throw an exception?
> If it causes an error that aborts the entire program, or it throws an exception (even if it could be caught!), then I think this should not be allowed.
My colleague Marshall expects that a simple APL translation of the your Python solution would be a lot faster since the main cost should just be moving list data around, and Dyalog has a lot less data to move because it has bit Booleans.
Dead Frog Walking
code-golfarray-manipulation
Introduction
Jonny wants to play Frogger. However, he's not very good. In fact, he will only try to move forward, and only after the platforms have moved.
Find out if Jonny's frog manages to reach the end of the path, or if it dies and where.
Cha...
The easiest answer is; it's because the CPU addresses memory in bytes and not in bits, and bitwise operations are very slow.
However it's possible to use bit-size allocation in C++. There's std::vector specialization for bit vectors, and also structs taking bit sized entries.
You are given two arbitrary integer lists, e.g. [-10, 99, -6, 43], [100, 32, 44]. You are to pick one integer from each list and sum them up, then sort the best pairs ordered by the absolute distance to 100 in ascending order. Paired up integers from each list shall not be repeated in the output....
@ASCII-only My rule is "the array size is the largest power of 2 such that you can handle in time". If you can handle ~10kb in less than time limit then I will try more than that...
If you can make a linear solution it's going to be larger than that.
This is a bit similar to this dust covered entry but I'm hoping my spin on it makes it unique enough. Not been able to find anything dissuading me from posting this but there is quite the sea out there.
Anyway! The challenge:
Your code receives a string of characters; It converts this into an A...
Bytes vs Characters popularity-contest? tips
For almost every code-golf challenge on the site, the code size is measured in bytes rather than chars, in order to prevent people from taking shortcuts like stuffing a large amount of data into a unicode string. However, other sites, such as code-gol...
Assuming an algorithm requires an array of 1080 bytes of RAM(maybe not realistic, but theoretically the algorithm work). For languages like Python, [0]*(10**80) just theoretically work (ignoring optimizing here), but for C, currently there's only 64-bit machine, and avaliable RAM far not enough. ...
well here's the thing, given the regex I'm using, and the symbol I'm using, regex.test(symbol) should and is always returning true, except in that if statement
Is there a dangling else?
Define a statement as follows (Backur-Naur form) (based on Java syntax):
statement ::= ";"
| "if(true)" <statement>
| "if(true)" <statement> "else " <statement>
Example valid statements:
;
if(true);else ;
if(true);else if(true);else;
Your task is, given a vali...
> This website is under heavy load We're sorry, too many people are accessing this website at the same time. We're working on this problem. Please try again later.
@Zacharý On top of the original APL ("APL1" ≈ APL\360) there were basically two competing extensions: IPSA's and NARS. Dictionary follows IPSA. Dyalog follows NARS.
2 reasons: one, it errors on install since I have a dualbooted partition atm? no clue but that seems to be teh cause
two, I've been working on a largeish project and I don't want to mess it up by updating (backups yes but still I want a working computer), that ends in 2 days so I'll update then
but yes under any other circumstances I would have updated a while ago
Generate the Recamán Sequence
code-golfsequence
The newest Numberphile video talks about a sequence created by Bernardo Recamán Santos, a Colombian mathematician. The OEIS entry is here and it is defined as follows:
Start with the non-negative integers and with the number 0 at index 0.
The it...
ASCII Maze Compression (WIP)
code-challenge compression maze
Challenge
Design a compression algorithm specialized for compressing ASCII mazes. You will need to create both a compression algorithm and a decompression algorithm. Your score will be based on the size of your compressed mazes.
M...
Dead Frog Walking
code-golfarray-manipulation
Introduction
Jonny wants to play Frogger. However, he's not very good. In fact, he will only try to move forward, and only after the platforms have moved.
Find out if Jonny's frog manages to reach the end of the path, or if it dies and where.
Cha...
The easiest answer is; it's because the CPU addresses memory in bytes and not in bits, and bitwise operations are very slow.
However it's possible to use bit-size allocation in C++. There's std::vector specialization for bit vectors, and also structs taking bit sized entries.
This is a bit similar to this dust covered entry but I'm hoping my spin on it makes it unique enough. Not been able to find anything dissuading me from posting this but there is quite the sea out there.
Anyway! The challenge:
Your code receives a string of characters; It converts this into an A...
Is there a dangling else?
Define a statement as follows (Backur-Naur form) (based on Java syntax):
statement ::= ";"
| "if(true)" <statement>
| "if(true)" <statement> "else " <statement>
Example valid statements:
;
if(true);else ;
if(true);else if(true);else;
Your task is, given a vali...
Generate the Recamán Sequence
code-golfsequence
The newest Numberphile video talks about a sequence created by Bernardo Recamán Santos, a Colombian mathematician. The OEIS entry is here and it is defined as follows:
Start with the non-negative integers and with the number 0 at index 0.
The it...
ASCII Maze Compression (WIP)
code-challenge compression maze
Challenge
Design a compression algorithm specialized for compressing ASCII mazes. You will need to create both a compression algorithm and a decompression algorithm. Your score will be based on the size of your compressed mazes.
M...
