Skip to content

Instantly share code, notes, and snippets.

package baekjoon_Algorithm;
import java.util.*;
public class beakjoon_2606 {
public static void main(String[] args) {
Scanner scan = new Scanner (System.in);
int N = scan.nextInt();
boolean [] isvisited = new boolean[N+1];
package baekjoon_Algorithm;
import java.util.*;
public class baekjoon_1149 { // 최소값 누적시키면서 내려가기
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
int [][] colorArr = new int [N][3];
package baekjoon_Algorithm;
import java.util.*;
public class baekjoon_9416 {
static long [] arr = new long [101];
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int count = scan.nextInt();
package baekjoon_Algorithm;
import java.util.*;
public class baekjoon_1904 {
static int num = 15746;
static int N;
static int count = 0;
public static void main(String[] args) {
package baekjoon_Algorithm;
import java.util.*;
public class baekjoon_14563 {
public static void main(String [] args) {
Scanner scan = new Scanner(System.in);
scan.nextLine();
package baekjoon_Algorithm;
import java.util.*;
public class baekjoon_9184 {
static int [][][] arr = new int [51][51][51];
public static void main(String[] args) {
// TODO Auto-generated method stub
import java.util.Scanner;
public class baekjoon_1003{
static countOfNum[] arr = new countOfNum [41];
public static void main(String[]args){ // 0이 출력되는 횟수와 , 1이 출력되는 횟수 반환
Scanner scan = new Scanner(System.in);
package baekjoon_Algorithm;
import java.util.*;
import java.io.*;
public class baekjoon_14889_2 {
static int N;
static int[][] matrix;
static int min = 987654321;
package baekjoon_Algorithm;
import java.util.*;
public class baekjoon_14888 {
static int N;
static int [] numArr;
static String [] symbol;
static ArrayList <Integer> resultArr = new ArrayList <>();
package baekjoon_Algorithm;
import java.util.*;
// 규칙 : 대각선과 같은줄에 퀸이 2개이상 있으면 안됨
public class baekjoon_9663 {
static int count = 0;
static int N;