cschlisner

Keybase proof

I hereby claim:

• I am cschlisner on github.
• I am cschlisner (https://keybase.io/cschlisner) on keybase.
• I have a public key ASBLkE0uD3Rew51I52G85Mwb0UzW2-X-rsddpAj3lkdoBwo

To claim this, I am signing this object:

cschlisner

#include<iostream>
#include<cstdlib>
#include<string>
#include<cstdio>
#include "Player.cpp"

using namespace std;
 
class AssocData {

cschlisner

#include<iostream>
#include<cstdlib>
#include<string>
#include<cstdio>
using namespace std;
 
class HashMapSeparateChaining {
    
    private:

cschlisner

#include<iostream>
#include<cstdlib>
#include<string>
#include<cstdio>
using namespace std;
 
class HashMapOpenAddressing {
    
    private:

cschlisner

if (in.length() == 2)
    		in = "p"+in;
    	
    	String[] tokens = in.split("");
		String pieceSymbol = tokens[0];

		int rank = -1, file = -1;

		//[piece][rank OR file][destination] (e.g. Bfg6)
		if (tokens.length == 4){

cschlisner

import java.io.*;
import java.util.Scanner;
class timeCalc {
	
	private static class Time {
		public int seconds, minutes, hours;
		public int total = 0 ;
		public Time(String t){
			t = ":"+t;                          //format is now :hh:mm:ss, :mm:ss, or :ss
			int multiplier = 1;

cschlisner

project euler question 3 600851475143

hahaha

cschlisner

package tools;
import java.math.*;
public class sieve{
	private int n;
	public sieve(int i){
		n = i+1;
	}

	public int[] getPrimes(){
		if (n==3) return new int[]{2};

cschlisner

class q11 {
	public static void main(String args[]){
		int[][] map = new int[][]	{{8, 2,  22, 97, 38, 15, 0,  40, 0,  75, 4,  5,  7,  78, 52, 12, 50, 77, 91, 8},{49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4,  56, 62, 0},{81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3,  49, 13, 36, 65},{52, 70, 95, 23, 4,  60, 11, 42, 69, 24, 68, 56, 1,  32, 56, 71, 37, 2,  36, 91},{22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80},{24, 47, 32, 60, 99, 3,  45, 2,  44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50},								{32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70},{67, 26, 20, 68, 2,  62, 12, 20, 95, 63, 94, 39, 63, 8,  40, 91, 66, 49, 94, 21},{24, 55, 58, 5,  66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72},{21, 36, 23, 9,  75, 0,  76, 44, 20, 45, 35, 14, 0,  61, 33, 97, 34, 31, 33, 95},{78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3,  80, 4,  62, 16, 14, 9,  53, 56, 92},{16, 39, 5,  42, 96, 35, 31, 47, 55, 58, 88, 2

cschlisner

package tools;
public class sieve{
	private int n;
	public sieve(int i){
		n = i+1;
	}

	public int[] getPrimes(){
		int[] p = new int[n];
		int[] result;