Cod sursa(job #1083212)
Utilizator | Data | 15 ianuarie 2014 18:50:07 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <cstdio>
using namespace std;
int i[20],k,n,t;
void back(int p)
{
if(p==k+1){for(t=1;t<=k;t++){printf("%d ",i[t]);}printf("\n");}
else{for(i[p]=i[p-1]+1;i[p]<=n;i[p]++){back(p+1);}}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld%ld",&n,&k);
back(1);
return 0;
}