PenLift
Post
원문 보기 →PenLift
Code import java.util.ArrayList; public class PenLift { int len, size; boolean[] usedS, usedV; int[] nv; // num of vertices int[][] adj1, adj2; ArrayList xv, yv; boolean contains(int x,int y) { for (int i = 0; i < xv.size(); i++) if (xv.get(i)==x && yv.get(i)==y) return true; retur
Related Posts
3 postsMasterbrain
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++
BridgeCrossing
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
RectangularGrid
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
