Cod sursa(job #1487249)
| Utilizator | Data | 16 septembrie 2015 16:05:15 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
int n,m, viz[21]={0}, ans[21]={0};
void back(int k)
{
if( k == m ){
for(int i=1;i<=m;++i){
printf("%d ",ans[i]);
}
printf("\n");
return;
}
for(int j=ans[k]+1;j<=n;++j) {
if( viz[j] == 0 ) {
viz[j] = 1;
ans[k+1] = j;
back(k+1);
viz[j] = 0;
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(0);
return 0;
}
