• 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] 15657. N과 M(8)

15 Apr 2026

Reading time ~1 minute

  • 풀이

풀이

import java.util.Arrays;
import java.util.Scanner;

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


백트래킹중복조합 Share