Skip to content

Instantly share code, notes, and snippets.

View stphung's full-sized avatar

Steven Phung stphung

  • Autodesk, Inc.
  • San Francisco, CA
View GitHub Profile
@stphung
stphung / MathContest.java
Created April 26, 2011 16:31
TopCoder SRM 504 Division 2 - 500 point problem
import java.util.Stack;
public class MathContest {
public int countBlack(String ballSequence, int repetitions) {
String newBallSequence = ballSequence;
Stack<Integer> stack = new Stack<Integer>();
for (int i = newBallSequence.length() - 1; i >= 0; i--) {
if (newBallSequence.charAt(i) == 'B')
@stphung
stphung / ComparerInator.java
Created April 26, 2011 16:31
TopCoder SRM 504 Division 2 - 250 point problem
import java.util.Arrays;
public class ComparerInator {
public int makeProgram(int[] A, int[] B, int[] wanted) {
if (same(A, wanted))
return 1;
else if (same(B, wanted))
return 1;
else if (ltTest1(A, B, wanted))
/*
ID: stphung1
LANG: JAVA
TASK: barn1
*/
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
/*
ID: stphung1
LANG: JAVA
TASK: dualpal
*/
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
/*
ID: stphung1
LANG: JAVA
TASK: milk
*/
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
@stphung
stphung / ToastXToast.java
Created April 16, 2011 18:07
TopCoder SRM 503 Division 2 - 500 point problem
import java.util.Arrays;
public class ToastXToast {
public int bake(int[] undertoasted, int[] overtoasted) {
Arrays.sort(undertoasted);
Arrays.sort(overtoasted);
if (undertoasted[0] > overtoasted[0] || undertoasted[undertoasted.length - 1] > overtoasted[overtoasted.length - 1]) {
return -1;
} else if (undertoasted[undertoasted.length - 1] < overtoasted[0]) {
@stphung
stphung / ToastXRaspberry.java
Created April 16, 2011 18:06
TopCoder SRM 503 Division 2 - 250 point problem
public class ToastXRaspberry {
public int apply(int upper_limit, int layer_count) {
if (layer_count % upper_limit != 0) {
return layer_count / upper_limit + 1;
} else {
return layer_count / upper_limit;
}
}
}
@stphung
stphung / palsquare.java
Created April 15, 2011 04:33
My solution to "Palindromic Squares" from USACO
/*
ID: stphung1
LANG: JAVA
TASK: palsquare
*/
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
@stphung
stphung / namenum.java
Created April 15, 2011 03:10
My solution to "Name That Number" from USACO
/*
ID: stphung1
LANG: JAVA
TASK: namenum
*/
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
@stphung
stphung / transform.java
Created April 14, 2011 05:56
My solution to "Transformations" from USACO
/*
ID: stphung1
LANG: JAVA
TASK: transform
*/
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;