## Proof that NL is contained in P

I do not succeed to prove that.

How can I do that by using st-conn, or Savitch’s theorem?

I tried to use these but I did not succeed.

Thank you.

## How to find the hashed password contained in an encrypted file? [closed]

I have an encrypted "*.pbl" file (100kb) that contain my forgotten password. My password is very easy: number+lower case letters with length=6. Once I find the Hashed password I’ll quickly recover my password.

Of course the hash of a file can be found but it is still not the hash of a password. How do I find the hashed password?

One thing I could possibly do is to create another account with another password; this way I can generate a new encrypted file with the exactly same format and I might be able to find the position of my passwords.

PS: I did check related post but obviously I don’t need to do things like SQL injection because the file has always been on my local machine.

## is co-NP-hard contained in EXPTIME-hard or vice-versa?

is co-NP-hard contained in EXPTIME-hard or vice-versa?

## How to make this div element the size of the img contained within it? [css] [migrated]

I am attempting to create a tooltip, to appear when hovering on an image within a table. However when I add the div to put a container for the tooltip, it adds extra spacing to my table, as seen in the first row (not applied to subsequent rows).

Why is the div 118 x 66 size as shown instead of the size of the image within it (59×59 )? It creates unnecessary spacing.

## Packets contained no EAPOL data; unable to process this AP

I’m trying to hack my own WiFi using aircrack but have had no success. With aircrack I cannot achieve a successful handshake as the deauth doesn’t seem to have any effect on my targeted devices. This is what it outputs:

root@RPI02:~# aircrack-ng -w password.lst *.cap Opening WIFI_APPLE.cap-01.cap.. Read 180751 packets.     #  BSSID              ESSID                     Encryption     1  F1:2E:DG:F2:EE:0F  WIFI APPLE                WPA (0 handshake)  Choosing first network as target.  Opening WIFI_APPLE.cap-01.cap.. Read 180751 packets.  1 potential targets  **Packets contained no EAPOL data; unable to process this AP.** 

What exactly means this line?

Packets contained no EAPOL data; unable to process this AP.

## Where did this dungeon come from that was spiral shaped and contained a statue of Dagon?

I remember there being a dungeon for D&D 5e, possibly as part of an AL adventure (I don’t remember it being in a full published adventure like Out of the Abyss, etc), but if it was AL, I don’t remember which season (probably one of the earlier ones, though), or exactly how long ago it was. Me thinking it might have been AL might be a red herring.

It was a small dungeon, I feel like it only had 8 rooms or so, arranged in a spiral shape, and near the centre of the dungeon, I want to say area 7 but that might be wrong, there was a little alcove-like room with a shrine to Dagon there, and possibly a dead/undead creature or two in there. After this room, there was then the centre of the spiral, which contained the “boss fight” (I can’t remember what this boss fight was either).

I can’t remember what Tier this was for, but it was probably Tier 1, or Tier 2 at most; I don’t think it was higher level content.

That’s all I remember, although comment-questions may prompt me to remember a little more…

## How to grep a file if numbers contained begin with +1, and are in all number format

I am transferring Android SMS database to my iPhone manually without restoring. Because of the number format of +1562… iPhone does not recognize the format and creates a new text thread.

I am trying to change +15629876543 to 5629876543 and +17114747474 to 7114747474, and so on.

There are thousands more numbers ranging in size. Any other number that has more than or less than 10 digits, should be untouched.

This seems to be a step in the right direction. grep -P '(?<!\d)\d{4}(?!\d)' file retrieved from How to grep for groups of n digits, but no more than n?

Here is a sample of the file.

               <address>+15629876543</address>                <date>1554966601000</date>                <type>1</type>                <body> Yea, should be true. </body>                <mmsReaded>1</mmsReaded>                <attachments />            </sms>            <sms>                <isMms>1</isMms>                <date>1554968044000</date>                <type>2</type>                <mmsMsgBox>2</mmsMsgBox>                <mmsReaded>1</mmsReaded>                <attachments>                    <attachment>                        <type>image/jpeg</type>              <body></body>                        <name>Screenshot_20190411-002704_Flud.jpg</name>                    </attachment>                </attachments>            </sms>            <sms>                <isMms>0</isMms>                <address>+15621234567</address>                <date>1554968778000</date>                <type>1</type>   <isMms>0</isMms>                <address>+17141234534</address>                <date>1558919932000</date>                <type>1</type>                <body>:)</body>                <mmsReaded>1</mmsReaded>                <attachments />            </sms>            <sms>                <isMms>0</isMms>                <address>+17141234567</address>                <date>1558927846000</date>                <type>1</type>                <body>It&apos;s so</body>                <mmsReaded>1</mmsReaded>                <attachments />                <isMms>0</isMms>                <address>+17145757575</address>                <date>1543704644000</date>                <type>1</type>                <body>Hey</body>                <mmsReaded>1</mmsReaded>                <attachments />            </sms>            <sms>                <isMms>0</isMms>                <date>1543704676000</date>                <type>2</type>                <body>More text</body>                <mmsReaded>1</mmsReaded>                <attachments />            </sms>            <sms>                <isMms>0</isMms>                <address>+17142323232</address>                <date>1543704736000</date>                <type>1</type>                <body>Lol not even</body>                <mmsReaded>1</mmsReaded>                <attachments />            </sms>            <sms>                <isMms>0</isMms>                <address>+17141010101</address>                <date>1543704748000</date>                <type>1</type>                <body>You do</body>                <mmsReaded>1</mmsReaded>                <attachments />            </sms>  

## Given a set of intervals $(I_n)_n$ contained in $[0, L]$, compute the longest interval in $[0, L]$ which has empty intersection with all $(I_n)_n$

Let be $$(I_n)_n$$ a set of $$p$$ intervals each contained in $$[0, L]$$ for $$L \geq 1$$.

I define $$(J_n = [a_n, b_n])_n$$ the set of intervals which have empty intersection with $$I_n$$ for all $$n \in [[1, p]]$$.

I’d like to efficiently compute $$\max_n (b_n – a_n + 1)$$.

A basic idea I’d try would be to:

(1) Create a segment tree for $$(I_n)_n$$ in $$O(p \ln p)$$

(2) Iterate over $$[0, L]$$ and count the longest line before encountering an interval covered by $$(I_n)_n$$ (resetting the “max value” to 0 until the next of a certain $$J_q$$)

Which could give me an algorithm in $$O(L + p \ln p)$$, the problem is that $$L$$ is really big in my instances, I’d like to have an algorithm which does not depend on $$L$$.

## Algorithm for answering queries of the type “largest interval contained in the given interval”

I have been wondering over the following problem:

Given a set $$S$$ of intervals on the number line. We can do two operations on them:

1. Add a new interval $$[l,r]$$ to $$S$$
2. Given an interval $$[ql, qr]$$, which is possibly not in $$S$$, find the longest interval from $$S$$ which is contained entirely in $$[ql, qr]$$

If I didn’t have operation $$1$$ I have found a solution using a persistent segment tree.

For the full version, there is the trivial solution which runs in $$O(QN)$$. I also found that using interval tree, I can directly find which intervals intersect the query interval and then I can check them manually. However, is there an even better solution? Maybe $$O(NlogN)$$ or $$O(Nlog^2N)$$

## Get value from a dictionary contained in a dictionary

I have an API that returns a dictionary of dictionaries.

I currently have this code to access the value of the dictionary, but it looks like a code smell. Is there a better way to structure this?

// Dictionary<string, Dictionary<DateTime, string>> CountryCode();  var response = api.CountryCode();  string GB2001; if (response.ContainsKey("GB") && response["GB"].ContainsKey(new DateTime(2001, 04, 01))) {     GB2001 = response["GB"][new DateTime(2001, 04, 01)];      // Use the result of GB2001 here } `