• Home
  • About
    • Ryureka Moment photo

      Ryureka

      Sin Prisa, Sin Pausa

    • About Me
    • Facebook
    • Github
    • Youtube
  • Projects
  • Posts
    • Posts
    • ProblemSolvings
    • Tags
    • Blog
    • Examples
  • ProblemSolving
    • ProblemSolving
    • BOJ
    • Programmers
    • SWEA
    • LeetCode
  • FrontEnd
    • FrontEnd
    • HTML
  • BackEnd
    • BackEnd
    • Server
      • Server
      • Spring
      • NodeJS
    • DataBase
      • DataBase
      • MySQL
      • MongoDB
  • Programming
    • Programming
    • Java
    • JS
    • Python
    • CleanCode
  • ComputerScience
    • DataStructure
    • Algorithm

[BOJ] 15652. N과 M(4)

15 Apr 2026

Reading time ~1 minute

  • 풀이

풀이

import java.util.Scanner;

public class Main {
	static int arr[]=new int [8];
	static boolean c[]=new boolean[9];
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int M=sc.nextInt();
		go(0,N,M,1);
	}
	
	public static void go(int index,int N,int M,int start) {
		if(index==M) {
            StringBuilder sb=new StringBuilder();
			for (int i = 0; i < M; i++) {
				sb.append(arr[i]);
                sb.append(" ");
			}
			System.out.print(sb+"\n");
			return;
		}
		
		for(int i=start;i<=N;i++) {
			arr[index]=i;
			c[i]=true;
			go(index+1,N,M,i);
			c[i]=false;
		}
	}
}


백트래킹중복조합 Share