cciollaro

require 'socket'

#http://www.scribd.com/doc/34203336/How-to-Implement-RSA-in-Ruby#download
# Calculate a modular exponentiation eg: b^p mod m
def mod_pow(base, power, mod)
	result = 1
	while power > 0
		result = (result * base) % mod if power & 1 == 1
		base = (base * base) % mod
		power >>= 1

cciollaro

#http://www.scribd.com/doc/34203336/How-to-Implement-RSA-in-Ruby#download
# Calculate a modular exponentiation eg: b^p mod m
def mod_pow(base, power, mod)
	result = 1
	while power > 0
		result = (result * base) % mod if power & 1 == 1
		base = (base * base) % mod
		power >>= 1
	end
	result

cciollaro

class Array
	alias :peek :last
end
 
trials = gets.to_i
trials.times do |x|
	stack = []
	ctr = 0
	ptr = 0
	str = gets.chomp

cciollaro

blocks = (0..8).to_a.shuffle
puts blocks.inspect

i = 0
while i < 8
  until i == blocks[i]
    j = blocks[i]
    #swap blocks[i] with blocks[blocks[i]]
    blocks[i], blocks[j] = blocks[j], blocks[i]
  end

cciollaro

require 'digest'

input = ARGV.first || "chris"
lowest_digest = Digest::SHA512.hexdigest(input)
lowest_input = input
begin
       loop do
	        digest = Digest::SHA512.hexdigest(input)
	        if digest < lowest_digest
		       lowest_digest = digest

cciollaro

let's imagine you wanted to test Coin.js

1.) create test/coinTest.js
2.) write tests like these: http://pivotal.github.io/jasmine/. Jasmine is a really great library, go check out that page! :)
3.) when you've written your test, go to SpecRunner.html and include your test and dependencies like so: 
  <!-- include source files here... -->
  <script type="text/javascript" src="js/Coin.js"></script>

  <!-- include spec files here... -->
  <script type="text/javascript" src="test/coinTest.js"></script>

cciollaro

public class ModExp {

  public static void main(String[] args) {
		System.out.println(modExp(4,13,497));
	}
	
	public static int modExp(int a, int b, int n){
		int d = 1;
		String k = Integer.toBinaryString(b);
		for(int i = 1; i <= k.length(); i++){

cciollaro

public class CountingSort{
  public static void main(String[] args){
		int[] a = {5,6,7,1,2,4,5,6,1,0,3,4,2};
		printArray(countingSort(a, 7));
	}
	
	public static int[] countingSort(int[] a, int k){
		int[] b = new int[a.length];
		int[] c = new int[k + 1];
		for(int i = 0; i < a.length; i++)

cciollaro

//There are 100 people sat at a circular table. 
//You go around the table asking every second person to leave (starting by asking the guy at seat 1 to leave) until there is one person left. 
//Which seat is left?
//usage: java Survivor 100
class Survivor {
  public static void main(String[] args){
    int n = Integer.parseInt(args[0]);
    int result = eliminate(1, 1, n, false);
    System.out.println(result);
  }

cciollaro

#!/bin/sh

if [ $# -eq 0 ]
then
	echo "usage: explode <dir>"
	exit 1
fi
mv $1/* $1/..
rm -r $1