tmathmeyer

feh --bg-tile /home/ted/.rwpcd/pine.jpg

BORDER=3
PADDING=0

bspc config right_padding         $PADDING
bspc config left_padding          $PADDING
bspc config border_width          $BORDER
bspc config window_gap            -$BORDER
bspc config split_ratio           0.50

tmathmeyer

each.rankings.map(function(each){
    return each.rank
}).reduce(+));

tmathmeyer

#include <iostream>
using namespace std;

class BankEvent
{
    private: 
        int time;
    public:
        int getTime()
        {

tmathmeyer

long long log_epic(long long a)
{ // takes the log base 2 of a in log(log(a)) time
	long temp = a;
	int low = 0;
	int high = 0;
	int shift = 32;
	while(shift > 0)
	{
		while(temp > 0)
		{

tmathmeyer

#include <iostream>
 
using namespace std;
 
long long log_epic(long long a)
{
	long temp = a;
	int low = 0;
	int high = 0;
	int shift = 32;

tmathmeyer

public class SudokuData
{
  int[][] values = new int[9][9];



	public JTextField[][] convertToJTF()
	{
		//you implement this, it's REALLY easy
	}

tmathmeyer

public class RPSGame extends JFrame implements ActionListener
{
	int wins = 0;
	int ties = 0;
	int total = 0;

	JPanel scores;

	public RPSGame(String title)
	{

tmathmeyer

boolean isPrime(long n)
{//fermats :D
  if (n%2==0 || n%3==0)
	{
		return false;
	}
	boolean res = true;
	for (long a = 2; a<n; a*=2)
	{
		res = res&&exp_mod_itr(a,n,n)==a;

tmathmeyer

package edu.wpi.tmathmeyer.euler;

public class Probs {
	public static void problem30(){
		int[] fives = new int[10];
		for(int i = 0; i < 10; i++)
		{
			fives[i] = pow(i, 5);
			System.out.println(fives[i]);
		}

tmathmeyer

package edu.wpi.tmathmeyer.euler;

public class Problem433 {
	int[][] mem = new int[50000][];
	int size = 500000;
	
	public static void main(String[] args){
		new Problem433().problem();
	}