불타는 아잍(IT)스크림

Code public class RectangularGrid{ public long countRectangles(int width, int height) { long res = 0; for(int i = 0; i < height; i++) { for(int j = 0; j < width; j++) { if(i == j) continue; res += (height-i) * (width-j); } } return res; }} Problem 격자 무늬에서 직사각형의 개수를 구하라. (정사각형 제외) 예) 3x3 격자에서 1

Code import java.util.Arrays; public class BridgeCrossing{ int n, min; boolean[] a; int[] times; void go(int t, int num) { for (int i = 0; i < n; i++) { if (!a[i]) continue; a[i] = false; for (int j = i+1; j < n; j++) { if (!a[j]) continue; a[j] = false; if (num==2 && t+time

Code public class Masterbrain { String score(String g, String p) { int b = 0, w = 0; boolean[] ug = new boolean[4]; boolean[] up = new boolean[4]; for (int i = 0; i < 4; i++) { if (g.charAt(i)==p.charAt(i)) { b++; ug[i] = true; up[i] = true; } } for (int i = 0; i < 4; i++

Code public class Bonuses{ public int[] getDivision(int[] points) { int len = points.length; int sum = 0, extra = 100; boolean[] used = new boolean[len]; int[] percents = new int[len]; for (int i = 0; i < len; i++) sum += points[i]; for (int i = 0; i < len; i++) { percents[i] = 100*points[i] / sum; extra -=

Code public class HillHike{ public long numPaths(int distance, int maxHeight, int[] _landmarks) { long[][][] cache1 = new long[2][52][51]; long[][][] cache2 = new long[2][52][51]; cache1[0][0][0] = 1; int[] landmarks = new int[_landmarks.length+1]; System.arraycopy(_landmarks,0,landmarks,0,_landmarks.length); landmarks[_landmarks.length] = -1;