Pagini recente » Cod sursa (job #682310) | Cod sursa (job #2810701) | Cod sursa (job #2543495) | Cod sursa (job #433491) | Cod sursa (job #918760)
Cod sursa(job #918760)
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int s[100],n,m;
void afis(){
for(int i=1;i<=m;i++)
out<<s[i]<<' ';
out<<'\n';
}
int valid(int k){
for(int i=1;i<k;i++)
if(s[i]==s[k])return 0;
return 1;
}
void BKT(int k){
if(k==m+1)afis();
else{
s[k]=s[k-1];
while(s[k]<n-m+k){
s[k]++;
BKT(k+1);
}
}
}
int main(){
in>>n>>m;
BKT(1);
return 0;
}