[BOJ] N과 M (1) ~ (12)

 

1

https://www.acmicpc.net/problem/156549

2

https://www.acmicpc.net/problem/15650

3

https://www.acmicpc.net/problem/15651

4

https://www.acmicpc.net/problem/15652

5

https://www.acmicpc.net/problem/15654

6

https://www.acmicpc.net/problem/15655

7

https://www.acmicpc.net/problem/15656

8

https://www.acmicpc.net/problem/15657

9

https://www.acmicpc.net/problem/15663

10

https://www.acmicpc.net/problem/15664

11

https://www.acmicpc.net/problem/15665

12

https://www.acmicpc.net/problem/15666

 

BOJ - N과 M (1) ~ (12)

문제 유형: 재귀, 백트래킹

문제 난이도: Silver III ~ Silver I

시간 제한: 1초 (12번은 2초)

메모리 제한: ~512MB

 

재귀 연습문제이기에 따로 풀이를 적지는 않았다..

오름차순 출력을 위해서는 이전에 원본 숫자들을 정렬해놓으면 편하다.

 

제출 코드:

1

https://www.acmicpc.net/source/89500900

2

https://www.acmicpc.net/source/89500862

3

https://www.acmicpc.net/source/89786940

4

https://www.acmicpc.net/source/85527427

5

https://www.acmicpc.net/source/85572170

6

https://www.acmicpc.net/source/89787002

7

https://www.acmicpc.net/source/89787027

8

https://www.acmicpc.net/source/89806403

9

https://www.acmicpc.net/source/85615960

10

https://www.acmicpc.net/source/89807587

11

https://www.acmicpc.net/source/89809085

12

https://www.acmicpc.net/source/85388282