Cod sursa(job #899005)
| Utilizator | Data | 28 februarie 2013 12:32:21 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<cstdio>
using namespace std;
int i,n,m,v[20];
void backt(int k);
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
backt(1);
return 0;
}
void backt(int k)
{
int i=v[k-1]+1;
if(k==m+1){for(i=1;i<=m;i++)printf("%d ",v[i]);printf("\n");}
else while(i<=n)
{v[k]=i;
i++;
backt(k+1);
}
}
