jaysonrowe

for (var i=1; i <= 20; i++)
{
    if (i % 15 == 0)
        console.log("FizzBuzz");
    else if (i % 3 == 0)
        console.log("Fizz");
    else if (i % 5 == 0)
        console.log("Buzz");
    else
        console.log(i);

guifromrio

This can reduce files to ~15% of their size (2.3M to 345K, in one case) with no obvious degradation of quality.

ghostscript -sDEVICE=pdfwrite -dCompatibilityLevel=1.4 -dPDFSETTINGS=/printer -dNOPAUSE -dQUIET -dBATCH -sOutputFile=output.pdf input.pdf

Other options for PDFSETTINGS:

• /screen selects low-resolution output similar to the Acrobat Distiller "Screen Optimized" setting.
• /ebook selects medium-resolution output similar to the Acrobat Distiller "eBook" setting.
• /printer selects output similar to the Acrobat Distiller "Print Optimized" setting.
• /prepress selects output similar to Acrobat Distiller "Prepress Optimized" setting.

tssm

About programms

• Death to the Dialog Box
• Defending Perpetual Intermediacy
• Are your exceptions silent?
• Teaching Users to Read
• You'll Never Have Enough Cheese
• Gold Plating
• Happy Talk Must Die
• The Broken Window Theory

jakewtaylor

Increases indentation on the file tree and adds some lines to each directory/file.

Works 15 levels deep, but you can expand it by just adding more of each line thats repeating, i.e.:

• add another box shadow
  • (n*-20px) 0 0 0 rgba(255, 255, 255, 0.4)
• add another padding-left
  • .monaco-tree-row[aria-level="n"] { padding-left: ((n-1)*20)px; }
• add another :before & :after with left positioning
  • .monaco-tree-row[aria-level="n"]:before { left: (((n-1)*20)-9)px; }
• .monaco-tree-row[aria-level="n"]:after { left: (((n-1)*20)-9)px; }

nicknapoli82

A Way to Look at Tideman Lock Pairs

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.