« first day (3 days earlier)      last day (111 days later) » 

Mr. Xcoder
Mr. Xcoder
11:59
@cairdcoinheringaahing Many, many notifications :P...
 
1 hour later…
user202729
user202729
13:21
Graph isomorphism checking in Python, use naive algorithm in O(n! × n²), input as adjacency matrix.
(so short in comparison with Java)
Mr. Xcoder
Mr. Xcoder
Wow, O(n!n²)...
Or, O((n-1)!n³) :P
user202729
user202729
@Mr.Xcoder don't, I almost got it — NieDzejkob Dec 2 at 11:20
@NieDzejkob Really?
user202729
user202729
14:03
BTW, 
		graph = graph[:]
		next = graph.pop()
seems increbly wasteful.
Why not just next = graph[-1]?
(it's not that wasteful because it's a shallow copy, anyway)
Actually I don't understand why copying is necessary at all.
(probably to be sure, because Python list are mutable)
^ sorry...
user202729
user202729
14:44
@HyperNeutrino In your code, are cycles ordered or not?
user202729
user202729
15:37
Progress: I fixed HyperNeutrino's Python solution, so it works for input = 0 - 4, gives result 1, 1, 1, 2, 5 respectively. Currently I'm running it with input 5, hopefully it will gives 14.
Oh no... it returns 13.
user202729
user202729
16:04
Log file: here
 
2 hours later…
NieDzejkob
NieDzejkob
18:09
@user202729 I was working with the assumption that hypers solution worked

« first day (3 days earlier)      last day (111 days later) »