Finding sequence of pairs with second element of previous pair matching first element of next pair

I am interested in efficient ways of doing certain problem.

I have list of $ n$ pairs, where $ n$ is usually a few houndred thousands and each pair’s element is an integer (let’s assume it is integer from $ 0$ to $ 10000$ ) and I am trying to find a sequence such that it start and ends at chosen integer (we can assume it is eg. $ 0$ ) and second element of previous pair matches first element of next pair. So as an example, if we have set of pairs $ \{(0,1), (1,3), (3, 2) (3,0)\}$ the valid sequence would be eg. $ (0,1), (1,3), (3, 0)$ . If there is a few answers then I can find arbitrary one. Moreover it is no certain that my list of pairs actually has a solution. If it does not have solution, then the method should return no valid solutions.

I think that maybe some kind of dynamic programming could be useful here, but I don’t really have an idea for something better than just checking all the options, which I am almost certain is quite bad. Do you have any interesting insight about this problem?

Is it a risk if an html code from a textbox is rendered on the next page but searched string is not shown on the url?

I found a website in which the results are rendered on the next page. From “/search” address, the data is forwarded to “/result” without any trailing characters(searched item) on the address. But the html code from the first page is rendered on the next page, and yes javascript execution can be executed. Is this still a security risk even though the searched string is not on the address url?

Can you cast magic stone on 3 pebbles as a bonus action, throw a stone as a main action. Then ON YOUR NEXT TURN, throw the 2 remaining pebbles?

Can you cast magic stone on 3 pebbles as a bonus action, throw a stone as a main action. Then ON YOUR NEXT TURN, throw the 2 remaining pebbles? Like 1st thrown as “main action” & 2nd thrown as your “bonus action”, inside the “two weapon fighting rules”, from PHB pg 195 below


When you take the Attack action and attack with a light melee weapon that
you’re holding in one hand, you can use a bonus action to attack with a different light melee weapon that you’re holding in the other hand. You don’t add your ability modifier to the damage of the bonus attack, unless that modifier is negative. If either weapon has the thrown property, you can throw the weapon, instead of making a melee attack with it.

Seeing as there is no, individual, entry for “pebble” and/or “stone” (making it an improvised melee weapon?), but also seeing as the attacker is considered “proficient” (it doesn’t state your at any disadvantage with the stones) with the magic stone & its 100% considered “thrown” (or used as sling ammo), could it ALSO be assumed to be “light” (like a dagger, light hammer or hand ax is?).

Seeing the limited use of bonus action’s spells when attacking ranged as a druid

Magic stone, Shillelagh & Healing word, as options. None are “direct attacks”.

Especially before level 5, when produce flame & create bonfire out pace magic stone as ranged attack options, being able to “dual wield” 2 magic stones would be a doubling of action economy & damage output at range, mainly for druids levels 1 to 4

Side note I have melee handled with dual wielding a shillelagh’ed club with an off hand scimitar, its pre-level 5 ranged options I hope to expand

OpenSSH declares ssh-rsa deprecated. What do I do next?

With the 8.2 release of OpenSSH, they have declared that ssh-rsa for SHA-1 will soon be removed from the defaults:

Future deprecation notice

It is now possible[1] to perform chosen-prefix attacks against the SHA-1 hash algorithm for less than USD$ 50K. For this reason, we will be disabling the “ssh-rsa” public key signature algorithm that depends on SHA-1 by default in a near-future release.

This algorithm is unfortunately still used widely despite the existence of better alternatives, being the only remaining public key signature algorithm specified by the original SSH RFCs.

If I have (and might use, but not sure where) an ssh-rsa key, what are the next steps for me? Pretend I don’t have another key yet.

  1. Generate new key(s?).
  2. Add new keys to known services.
  3. Rename old key so it does not get picked up automatically?
    • This is to nudge me when I try a server that used to work, so I add the new key.
  4. ???

How do you use D&D Next monster statistics (e.g. in “Murder in Baldur’s Gate”) with 5e?

I would like to test 5e and have acquired the “Murder in Baldur’s Gate” adventure.

Now I find that the monster statistics in the adventure are “D&D Next”, the playtesting version of 5e. There are no classes for any NPC, just “Actions”, “Traits” and a Level for Encounter Building.

So: How do I use such statistics with 5e? Is there a conversion tool for “D&D Next” to 5e or am I missing something critical?

We are use to drivie your Business to Next Level

Our years of experience has allowed us to keep up with the ever changing technologies of search engines so we can ensure that all of our websites are completely search engine friendly from day one. Our aim is not to simply provide an attractive website for your potential clients but also we aim to build websites that are going to benefit you. To make sure we are providing you with the best website design service around, we even include domain registration, hosting, branding, marketing and search engine optimization – extra services that could cost you thousands from external vendors.

CRM Software Services records customer contact information such as email, telephone, website social media profile, and more. It can also automatically pull in other information, such as recent news about the company’s activity, and it can store details such as a client’s personal preferences on communications.

Our mission is to provide you with a marketing tool that is not only attractive but also one that will keep pace with the ever changing demands of the “search engine” society. Should you require it, we will include at a very nominal fee, domain registration, hosting, branding, marketing and search engine optimization (SEO). Extra services such as these would normally cost additional hundreds and thousands from other vendors.

All of my players are not able to make my next session- XP Gambling Arena [closed]

First post guys, thanks for reading. This is about d&d 5e.

There will only be 4/6 of the players there although the 2 players that are missing will allow their characters to be played. I’m going to have the players transported to a Gladiator arena on a different plane of existence where essentially they will be able to gamble their XP to fight against a list of 20 monsters. I’ll generate the list and roll a d20 to determine what they fight. I’m thinking about putting 2 deadly encounters, 10 Hard encounters, 6 medium encounters and 2 easy encounters on the list. Basically, the amount of XP they bet- they will lose that amount and essentially they could de-level if they lose too much. This does not in any way affect the mortality of their actual characters. Story-wise they are sent to this arena to entertain a bunch of gods essentially.

My question is, how much XP should i allow them to gamble? Also, feel free to throw out ideas of how I can modify this to make it more fun for them.

Decision tree: how to decide the next node?

data set

I have to decide for which value of “Klasse”

How do i do it?

I know that I have to decide on maximum information gain

So first off I’ve calculated the entropy of “Klasse”

That is E(Klasse)= -(3/11*log(3/11)+3/11*log(3/11)+5/11*log(5/11)) = 1.067

So how do I proceed from that?

I now need to find the first decision node, yes?

And how do I proceed if I’ve found a decision node ?


How well will the max transformation rounds in Keepassx deter an attacker for the next twenty years?

Keepassx lets you decide how many transformations rounds need to be run in order to unlock your Keepass database. In my version of Keepassx (2.0.3) the max value seems to be 999,999,999. With that setting it takes my laptop about 22 seconds to unlock the database. I imagine that a beefy workstation would take less time than that. With that in mind, how well can this setting deter someone else from accessing your database, assuming that they managed to get access to it? Let’s just say an individual (not an organization) with a computer made to do this kind of work. How much work can you assume that they will have to do per try with the kind of computation power that they will have access to in twenty years?

What is the LTL expression for “there is a value of y whose next value is 8”?

Basically i have a program which increases a variable by 1 in each iteration and resets it to 0 as soon as y becomes 8 (i.e. mod 8).

It is a quite simple example but it still bugs me out because i cannot clarify if my LTL-formula is correct for the property “there is a value of y whose next value is 8”. For this i came up with the:

$ $ FX(y \doteq 8)$ $

which means “somewhere in the future the next value of y is 8″.

Is it the correct LTL formula for my question (even though it is of course invalid for my application)?