ПАнимаю

• ###### opittcommented on "Boolean Trilogy #2: Calculate Boolean Expression (Easy)" python solution

What a surprise solution. Reading the reference manuals help - but who is reading it so carefully?
I learned another great gem of Python.

solved

• ###### Rail-Guncommented on "Graph-like Sequence" kata

Added a message for fixed and small tests.

• ###### dfhwzecommented on "Graph-like Sequence" kata

Still, I would recommend to add a custom error message. This makes life easier for people attempting the kata.
std::assert_eq

• ###### Rail-Guncommented on "Graph-like Sequence" kata

You can print the input data `println!("{:?}", degrees)`, testing ends at the first assertion failed.

• ###### dfhwzecreated a question for "Graph-like Sequence" kata

Is it possible to show which sample test is failing in Rust?

```assertion failed: `(left == right)`
left: `true`,
right: `false`
```
• ###### Rail-Guncommented on "Graph-like Sequence" kata

I am very happy to read this)

• ###### Ciprian Amzacommented on "Graph-like Sequence" kata

I am always happy to see such an interesting kata. Chapeau!

• ###### Rail-Guncommented on "Graph-like Sequence" python solution

This comment is hidden because it contains spoiler information about the solution

• ###### Blind4Basicscommented on "Graph-like Sequence" kata

mmmh, ok. I'm a bit surprised, but ok (oh, right, I didn't pay attention to the fact that the graphs are rather sparse)

• ###### Rail-Guncommented on "Graph-like Sequence" kata

Perhaps I am not well versed in the mechanics of spoilers.

If I understand correctly, you suggested the following algorithm:

``````for i in range(num_of_vertices):
for j in in range(i+1, num_of_vertices):
e = randint(0, 1)
matrix[i][j] = e
matrix[j][i] = e
``````

I tried it and got a huge performance drop.