riovv

cl_bob 0
cl_bobcycle 0
cl_minmodels 1
cl_cmdrate "101"
cl_updaterate 102
max_shells 10
max_smokepuffs 0

rate 25000
fps_max "101"

riovv

// CS:GO buynds
// Keeping it simple to avoid misbuys
// If I want to buy something else I first purchase armor, kit etc. then manually buy that weapon.
//
// Put this in your "csgo/cfg/autoexec.cfg"
//
// =======================
//         NUMPAD
// =======================
//   0   = Vest+Helm or Vest only

riovv

var fib = function (n) {
  var i,
      fn = 0,
      f1 = 0,
      f2 = 1;

  if (n < 2) return n;

  for (i = 2; i <= n; i++) {
    fn = f1 + f2;

riovv

/*
 * Count inversions in an array using JavaScript
 * Friday fun writing algorithms as UNREADABLE CODE WITH FEW LINEZ FTW :D::D
 */

var array_inversions = function (A) {
  var I = 0, 
      R = function (A) { return (A.length < 2) ? A : M(R(A.splice(0, A.length/2)), R(A)) },
      M = function (B, C) {
        var D = []    

riovv

# Find files > 20MB
find . -type f -size +20000k -exec ls -lh {} \; | awk '{ print $9 ": " $5 }'
# Find directories >= 1GB
du -h . | grep ^[0-9.]*G

riovv

/** 
 * Written in Node.js
 * http://nodejs.org
 *
 * Author: Patric Nordmark
 *
 * Usage: node index.js [-t [n]] [<input file>] [<output file>]
 *
 * Running node index.js without any parameters will solve all
 * test cases in input.txt and write the results to output.txt

riovv

// JavaScript: Greatest Common Divisor
var gcd = function (n, m) {
  var r = 0;
  while (n !== 0) {
    r = m % n;
    m = n;
    n = r;
  }
  return m;
};