import java.math.BigInteger;
public class BigProblem {
public static void main(String[] args) {
BigInteger fiveThousand = new BigInteger("5000");
BigInteger fiftyThousand = new BigInteger("50000");
BigInteger fiveHundredThousand
= new BigInteger("500000");
BigInteger total = BigInteger.ZERO;
total.add(fiveThousand);
total.add(fiftyThousand);
total.add(fiveHundredThousand);
System.out.println(total);
}
}
import java.util.*;
public class Name {
private String first, last;
public Name(String first, String last) {
this.first = first;
this.last = last;
}
public boolean equals(Object o) {
if (!(o instanceof Name))
return false;
Name n = (Name)o;
return n.first.equals(first) && n.last.equals(last);
}
public static void main(String[] args) {
Set s = new HashSet();
s.add(new Name("Mickey", "Mouse"));
System.out.println(
s.contains(new Name("Mickey", "Mouse")));
}
}
import java.util.*;
public class Name {
private String first, last;
public Name(String first, String last) {
this.first = first; this.last = last;
}
public boolean equals(Name n) {
return n.first.equals(first) && n.last.equals(last);
}
public int hashCode() {
return 31 * first.hashCode() + last.hashCode();
}
public static void main(String[] args) {
Set s = new HashSet();
s.add(new Name("Donald", "Duck"));
System.out.println(
s.contains(new Name("Donald", "Duck")));
}
}
import java.util.*;
public class Differences {
public static void main(String[] args) {
int vals[] = { 789, 678, 567, 456, 345, 234, 123, 012 };
Set diffs = new HashSet();
for (int i = 0; i < vals.length; i++)
for (int j = i; j < vals.length; j++)
diffs.add(vals[i] - vals[j]);
System.out.println(diffs.size());
}
}
import java.util.*;
public class OneLiners {
public static void main(String[] args) {
// Part A
String[] breakfast = { "spam", "sausage", "spam", "spam", "bacon",
"spam", "tomato", "spam" };
System.out.println(withoutDuplicates(Arrays.asList(breakfast)));
// Part B
String weaponry = "fear, surprise,ruthless efficiency, an almost " +
"fanatical devotion to the Pope, nice red uniforms";
System.out.println(Arrays.asList(parse(weaponry)));
// Part C
int[][] magic = {{6, 7, 2}, {1, 5, 9}, {8, 3, 4}};
System.out.println(arrayToString(magic));
// Part D
System.out.println(hasMoreBitsSet(0x0f0f0f0f, 0x88888888)); // true
System.out.println(hasMoreBitsSet(0x88888888, 0x0f0f0f0f)); // false
}
// Part A
static List withoutDuplicates(List original) {
// Your code goes here
}
// Part B
static String[] parse(String string) {
// Your code goes here
}
// Part C
static String arrayToString(Object[] array) {
// Your code goes here
}
// Part D
static boolean hasMoreBitsSet(int i, int j) {
// Your code goes here
}
}
import java.util.*;
public class DatingGame {
public static void main(String[] args) {
Calendar cal = Calendar.getInstance();
cal.set(1999, 12, 31); // Year, Month, Day
System.out.print(cal.get(Calendar.YEAR) + " ");
Date d = cal.getTime();
System.out.println(d.getDay());
}
}
import java.util.*;
public class NameGame {
public static void main(String args[]) {
Map m = new IdentityHashMap();
m.put("Mickey", "Mouse");
m.put("Mickey", "Mantle");
System.out.println(m.size());
}
}
import java.util.*;
public class MoreNames {
private Map m = new HashMap();
public void MoreNames() {
m.put("Mickey", "Mouse");
m.put("Mickey", "Mantle");
}
public int size() {
return m.size();
}
public static void main(String args[]) {
MoreNames moreNames = new MoreNames();
System.out.println(moreNames.size());
}
}
public class Mod {
public static void main(String[] args) {
final int MODULUS = 3;
int[] histogram = new int[MODULUS];
// Iterate over all ints (Idiom from Puzzle 25)
int i = Integer.MIN_VALUE;
do {
histogram[Math.abs(i) % MODULUS]++;
} while (i++ != Integer.MAX_VALUE);
for (int j = 0; j < MODULUS; j++)
System.out.println(histogram[j] + " ");
}
}
import java.util.*;
public class SuspiciousSort {
public static void main(String[] args) {
Random rnd = new Random();
Integer[] arr = new Integer[100];
for (int i = 0; i < arr.length; i++)
arr[i] = rnd.nextInt();
Comparator cmp = new Comparator() {
public int compare(Integer i1, Integer i2) {
return i2 - i1;
}
};
Arrays.sort(arr, cmp);
System.out.println(order(arr));
}
enum Order { ASCENDING, DESCENDING, CONSTANT, UNORDERED };
static Order order(Integer[] a) {
boolean ascending = false;
boolean descending = false;
for (int i = 1; i < a.length; i++) {
ascending |= a[i] > a[i-1];
descending |= a[i] < a[i-1];
}
if (ascending && !descending)
return Order.ASCENDING;
if (descending && !ascending)
return Order.DESCENDING;
if (!ascending)
return Order.CONSTANT; // All elements equal
return Order.UNORDERED; // Array is not sorted
}
}
