GCD of two integer is the largest integer that divide both given integers.
Find the integer factorization of the two integer first, find the common factors and multiply together.
The key idea of Euclidean algorithm is to use the smaller integer to …
What file permissions the web documents should have in order to make development process easier?
The answer depends. For my use case, I want to avoid using sudo to copy documents
from the user’s home to the Apache document root directory every time I want to
update a file. Because the /etc/www directory owned by …
I was stuck for a while when solving the leetcode problem Remove 9 . After sketched a relatively complicated solution, I decided to give myself a hint by reading the discussion board. It is all about numeric base conversion! When I tried to write the routine to convert a decimal number to a number in base 9, I found it …
When reading the book “Accelerated C++” years ago, I was impressed by the effectiveness of loop invariant in ensuring bug-free of many functions implemented in the book. That reading opens me another door to formulate and solve some of the error-prone programming problems. The idea of loop invariant is a …
I was surprised when I was told that University of Miami have its first Cybersecurity Conference in October 22th, because UM and Miami itself are not technology oriented. Before coming to the event, I quite doubt about the success of the event though Mr. Joe Sullivan, the CSO of Uber Technology, former CSO at Facebook, …