Samsung Advance Problem

package Advance; import java.io.FileInputStream; import java.util.Scanner; public class CleaningRobot { public static void main(String[] args) throws Exception { new CleaningRobot().inIt(); } int M; int N; int matrix[][]; Location dirty[]; int numDirty; int xRB, yRB; int[][] move = { { 0, 1 }, { 0, -1 }, { 1, 0 }, { -1, 0 } }; MyQueue mQ; int[][] matrixEnd; int min; int visit[]; int Result; class Location { int x; int y; public Location(int a, int b) { x = a; y = b; } } class MyQueue { Location ele[]; int front; int rear; public MyQueue() { front = rear = 0; ele = new Location[10001]; } boolean isEmpty() { if (front == rear) return true; else return false; } void Qpush(Location x) { ele[rear] = x; rear++; if (rear == 10001) rear = 0; } Location Qpop() { Location a = ele[front]; front++; if (front == 10001) front = 0; return ...

package Advance; import java.io.FileInputStream; import java.util.Scanner; public class ChessRook { public static void main(String[] args) throws Exception { new ChessRook().inIt(); } int N; int[][] chess; int max; private void inIt() throws Exception { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); for (int test_case = 1; test_case <= T; test_case++) { N = sc.nextInt(); chess = new int[N][N]; max = 0; for (int i = 0; i < N; i++) { String s = sc.next(); for (int j = 0; j < s.length(); j++) { if (s.charAt(j) == 'X') { chess[i][j] = 2; } } } back(0, 0); System.out.println("Case #" + test_case); System.out.println(max); } } private void back(int row, int dem) { if(dem > max){ max = dem; } int i,j; for (i = row; i < N; i++) { for (j = 0; j < N; j++) { if (check(i, j) == true) { chess[i][j] = 1; back(i, ...

package Advance; import java.io.FileInputStream; import java.util.Scanner; public class CheckingCube { public static void main(String[] args) throws Exception { new CheckingCube().inIt(); } int D; int Result; private void inIt() throws Exception { Scanner sc = new Scanner(System.in); int T; T = sc.nextInt(); for (int test_case = 1; test_case <= T; test_case++) { D = sc.nextInt(); Result = 0; backtrack(0, 50, 0); System.out.println("#" + test_case + " " + Result); } } private void backtrack(int total, int num, int c) { if (c > 5) { return; } if (total > D) { return; } if (total == D) { Result++; return; } for (int i = num; i >= 0; i--) { backtrack(total + (i * i * i), i, c + 1); } } }

package Advance; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.util.Scanner; public class Solution{ static int S; static int K; static int M; // col static int N; // row static int dem; static int min; static MyQueue myQueue; static int table[][]; static int[][] K_move = { { -2, -1 }, { -2, 1 }, { -1, -2 }, { -1, 2 }, { 1, -2 }, { 1, 2 }, { 2, -1 }, { 2, 1 } }; static class Location { int x; int y; public Location(int a, int b) { x = a; y = b; } } static class MyQueue { Location ele[]; int front; int rear; public MyQueue() { front = 0; rear = 0; ele = new Location[10000]; } boolean isEmpty() { if (front == rear) return true; else return false; } void push(Location x) { ele[rear] = x; rear++; if(rear == 10000) rear = 0; } Location pop() { Location a = ele[front]; front++; if(front == 10000) front = 0; ret...

package Advance; import java.io.FileInputStream; import java.util.Scanner; public class BieuThucZero { public static void main(String[] args) throws Exception { new BieuThucZero().inIt(); } int N, Result; int key[]; int k, t; String bieuthuc; private void inIt() throws Exception { Scanner sc = new Scanner(System.in); int T; T = sc.nextInt(); for (int test_case = 1; test_case <= T; test_case++) { N = sc.nextInt(); key = new int[N - 1]; Result = 0; backtrack(0); System.out.println("#"+test_case + " " + Result); } } private void backtrack(int num) { if (num == N - 1) { if (checkEnd() == 0) { Result++; } return; } for (int i = 0; i < 3; i++) { key[num] = i; backtrack(num + 1); } } private int checkEnd() { bieuthuc = getString(); k = t = 0; int[] num = new int[N]; int op[] = new int[N - 1]; for (int i = 0; i < bieuthuc.length(); i++) { if ...

package Advance; import java.io.FileInputStream; import java.util.Scanner; public class BattleCity {     public static void main(String[] args) throws Exception {         new BattleCity().inIt();     }     int N, M, xS, yS, xF, yF;     final static int TARGET = -5;     final static int BRICK = -2;     final static int EMPTY = 0;     int Result;     int matrix[][];     int layer[][];     MyQueue mQ;     int move[][] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};     class Location {         int x;         int y;         int value;         public Location(int a, int b, int v) {             x = a;             y = b;             value = v;       ...