$ export https_proxy='87.248.188.202:8080'
$ export http_proxy='87.248.188.202:8080'
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
sudo rm /var/lib/ubuntu-release-upgrader/release-upgrade-available | |
sudo /usr/lib/ubuntu-release-upgrader/release-upgrade-motd |
I've observed that there is a little bit of a disconnect in understanding what it is that needs to be done to properly implement the lock_pairs function for cs50 Tideman. The goal of this little write-up is simply an attempt at explaining what the problem actually is, and why a cycle imposes a problem.
First:
If you are unfamiliar with the actual problem, or have not read through the entire cs50 Tideman problem description. Then I think you should start there.
cs50 Tideman
Second:
This little write-up is only narrowing in on the idea of cycles, and a way to think about what a cycle is and determine if locking a pair in the pairs
array would create that cycle. This does not talk about any other part of the Tideman problem.