6603번 로또

기본적인 백트래킹 문제다.

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

#include <iostream>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
 
using namespace std;
 
int k = 0;
 
vector<int> lotto;
 
void BackTracking(vector<int> answer, int pos)
{
    if (answer.size() == 6)
    {
        for (int lotto_number : answer)
        {
            printf("%d ", lotto_number);
        }
 
        printf("\n");
 
        return;
    }
 
    for (int i = pos; i < k; i++)
    {
        answer.push_back(lotto[i]);
        BackTracking(answer, i + 1);
        answer.pop_back();
    }
}
 
int main(void)
{
    int number = 0;
 
    while (1)
    {
        scanf("%d", &k);
 
        if (k == 0) break;
 
        for (int i = 0; i < k; i++)
        {
            scanf("%d", &number);
 
            lotto.push_back(number);
        }
 
        vector<int> v;
 
        BackTracking(v, 0);
 
        printf("\n");
 
        if (!lotto.empty()) lotto.clear();
    }
 
    return 0;
}