Pagini recente » algoritmiada-2016/runda-3/solutii/examen | Atasamentele paginii Profil tavi.belu1994 | Diferente pentru utilizator/05_yohn intre reviziile 11 si 10 | Monitorul de evaluare | Cod sursa (job #1083212)
#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;
}