Cod sursa(job #545238)
Utilizator | Data | 2 martie 2011 22:41:27 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,v[20],i,k;
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=k+1;i<=n;i++)
v[i]=1;
while(!next_permutation(v+1,v+n+1))
{
for(i=1;i<=n;i++)
if(!v[i])
printf("%d ",i);
printf("\n");
}
return 0;
}