Cod sursa(job #1331979)
Utilizator | Data | 1 februarie 2015 15:07:58 | |
---|---|---|---|
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 n,m,st[30];
void afis()
{
int i;
for (i=1;i<=m;i++)
cout<<st[i]<<" ";
cout<<'\n';
}
void back(int k)
{
if (k==m+1)
afis();
else
{
st[k]=st[k-1]+1;
for (;st[k]<=n;st[k]++)
back(k+1);
}
}
int main()
{
cin>>n>>m;;
back(1);
}