Cod sursa(job #1313299)
Utilizator | Data | 10 ianuarie 2015 15:33:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
bool v[100];
int main()
{
freopen ("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int n,k;
scanf ( "%d%d" , &n , &k );
fill(v+k+1,v+n+1,true);
do
{
for(int i=1;i<=n;++i)
if(!v[i])
printf("%d ",i);
printf("\n");
}while(next_permutation(v+1,v+n+1));
return 0;
}