Show newer

@zlax
Tagging me means ANY message that you post that has @ freemo @ qoto.org

If you do this when you have been told not to it is harassment. Reply all you want but you di NOT tag me when you do

@pschwede Well I think its a bit of a reverse here. Ballerinas started non-sexually and became sexualized.

Pole dancing as far as I know started as something specific to strippers, so it started as a sexualized practice and only recently has become desexualized.

So same thing in reverse order it seems.

Thoughts? Is this ok?

My feeling is despite the origins in stripping in its current form it is no different than dancing. I dont see a problem with this. But I'd like to hear your thoughts.

@zlax I asked you not to tag me multiple times, now you continue again!?

@Surasanji and @arteteco I am apparently still getting tagged by this guy who insists people do what he says and wont settle for anything else. Can we please just suspend his instance already.

Ironically suspending his instance will also satisfy his request that he doesnt get "ads" without violating his principles (which apparently means blocking someone)

I also investigated further and it does appear zlax goes out of his way to intentionally avoid bans from other servers, opening multiple accounts after being blocked We can not let this sort of harassment run rampant from an admin of another server.

Why do riot police show up to work early?

To beat the crowds.

Here is a which corresponds to the general case of a problem I ran up against recently.

Given a positive integer K and a directed graph G with weighted edges, return a new graph H satisfying all the following conditions, if such a graph exists:

1. G and H contain exactly the same set of vertices.
2. H contains only edges in G, but G may contain edges not in H.
3. A path exists in H of length at most K between each pair of vertices in each direction.
4. No edge can be removed from H while still satisfying condition 3.

Where more than one graph exists satsifying these conditions, return the one with the least total weight. You may assume G does not contain edges with negative weights.

Here is an example G, each triplet representing the <start, end, weight> of an edge:
<1, 2, 40>
<1, 3, 12>
<1, 4, 50>
<2, 1, 84>
<2, 3, 19>
<2, 4, 69>
<3, 1, 25>
<3, 2, 78>
<3, 4, 93>
<4, 1, 75>
<4, 2, 36>
<4, 3, 96>

Your program should produce the following H given the above G and K = 2:
<1, 2, 40>
<1, 4, 50>
<2, 1, 84>
<2, 3, 19>
<3, 1, 25>
<4, 2, 36>

@luki Welcome, how can we help? I'm a mod here so reach out with any questions

@sptnkmmnt

I wouldnt worry about it if i were you. We made our decision and are handling it. He keeps insisting wanting to get his way but we made our decision clear. If he keeps at it he will only get his instance silenced but i hope he lets up.

@arteteco @Surasanji

@edwardbailey Hi, QOTO admin here.

I notice this is the only post you have on a new account. I wanted to ask if this is an advertising/promotion account for the link you just gbave.

While it is welcome for people to occasionally post from their blog or website we do not allow exclusive advertising or promotion here. An account must post from an active user and otherwise be active on the network beyond promoting a single product.

So I'd like to follow up if that is the case here or not.

@arteteco @Surasanji

Show older
CleverLibre Social

CleverLibre Social is an inclusive social instance for open discussion, learning, and community.
All cultures welcome.
Hate speech and harassment strictly forbidden.