Cod sursa(job #2076163)
Utilizator | Data | 26 noiembrie 2017 11:48:07 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int X[20],k,n,m;
void tipar(int m){
int j;
for(j=1;j<=m;j++)
cout<<X[j]<<" ";
cout<<'\n';
}
void comb(int k){
int i;
for(i=X[k-1]+1;i<=n;i++){
X[k]=i;
if(k==m)
tipar(m);
else
comb(k+1);
}
}
int main()
{
cin>>n>>m;
X[0]=0;
comb(1);
return 0;
}