Cod sursa(job #428684)
Utilizator | Data | 29 martie 2010 14:34:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
# include <algorithm>
using namespace std;
int n,k;
bool a[19];
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &k);
for (int i=1;i<=k;i++)
a[i]=true;
do{
for (int i=1;i<=n;i++)
if (a[i]) printf("%d ", i);
printf("\n");
}while (prev_permutation(a+1,a+n+1));
return 0;
}