« first day    last day (47 days later) » 

1:02 AM
Pad... which one? To which length?
 
1:15 AM
Ok, done.
 
 
9 hours later…
10:27 AM
I have a feeling that the next program will be terrible brute-force again...
3
A: Add an edge to a graph without becoming nonplanar

Misha LavrovThe approach you're taking is much more complicated than the easiest approach to generating the graphs counted by A000109. So if you don't mind, I'll give you an easy-to-implement way to generate those graphs, rather than an easy-to-implement way to check for planarity (which I'm not sure exists,...

^ Very related.
Basically number of planar graph with degree of every vertices >= 4 and deduplicate by spherical isomorphic.
Although, it's quite surprising to me that planarity testing can be done in O(n). Unfortunately graph isomorphism can't be done effectively (with known methods).
 
 
3 hours later…
1:17 PM
@user202729 If ^W when Hyper fixes his solution to A000109, the rest is peace of cake
 
What is ^W?
 
Ctrl-W
 
Oh yes... I'm not familiar with Linux (as I said earlier).
But... I still don't understand.
 
when you press Ctrl-W in a terminal, it will erase one word from the command line
 
Not working in Windows CMD...
 
1:29 PM
because it's windows?
 
And Windows Powershell too. / Probably. / Oddly, exit in Powershell in normal mode enter debug mode.
 
 
1 hour later…
2:59 PM
The bytecount of 330 was already used, too. — Engineer Toast 52 secs ago
@NieDzejkob ^
 
INTERCOURSE
@user202729 would you mind if we fix it by golfing the answer to 212 bytes?
 
I don't like obfuscated solutions.
The nearest available is 332 and 328. Probably one of them will work. How easy (hard) are they?
 
I'll go with 332
 
 
3 hours later…
6:36 PM
You can update your answer now, I'm almost finished updating the explanation
 

« first day    last day (47 days later) »