Algorithm/BOJ

6603 로또

henry1214 2018. 7. 9. 23:33

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



1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include <cstdio>
#include <algorithm>
using namespace std;
 
int n,i,a[12],p[12];
 
int main()
{
    while(true)
    {
        scanf("%d",&n);
        if(!n) break;
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        for(i=0;i<n;i++) p[i]=i<6?0:1;
        do
        {
            for(i=0;i<n;i++) if(!p[i])
                printf("%d ",a[i]);
            printf("\n");
        } while(next_permutation(p,p+n));
        printf("\n");
    }
    return 0;
}
cs