dfs

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 package backjun; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class backjun_1520_내리막길 { private static int column; private static int row; private static ..

코테에서 자주 나오는 내용 같아서 정리해보고 갑니다. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 static void dfs(int nn){ if(nn>=n*n-1) return ; //base line int x = nn%6; int y = nn/6; //do something; } int main(){ //n=6; for(int i=0; i