int[] a = {3, 1, 2};
java.util.Arrays.sort(a);
System.out.println(java.util.Arrays.binarySearch(a, 2));

int n = 3, r = 1;
for (int i = 1; i <= n; i++) r *= i;
System.out.println(r);

int a = 1, b = 2;
int x = (a++ > 1) ? a : b++;
System.out.println(a + "," + b + "," + x);

String s = "a";
for (int i = 0; i < 3; i++) s += i;
System.out.println(s);

int[][] m = { {1,2}, {3,4,5} };
System.out.println(m[1].length);

int x = 0;
int v = 3;
switch (v) {
  case 1: x += 1; break;
  case 2:
  case 3: x += 3;
  default: x += 5; break;
}
System.out.println(x);

class A { int v = 1; A(){ v *= 2; } }
A a = new A();
System.out.println(a.v);

class C { 
static int s=0; 
int i=0;
 C(){
 s++;
 i++;
 } 
}
C a = new C();
C b = new C();
System.out.println(C.s + "," + b.i);