Cod sursa(job #1048417)
Utilizator | Data | 5 decembrie 2013 20:45:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int n,x[100],m;
ifstream in("combinari.in");
ofstream out("combinari.out");
void afisare(int k)
{
int i;
for(i=1;i<=k;i++)
out<<x[i]<<" ";
out<<'\n';
}
void back(int k)
{
int i;
for(i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
if(k==m)
afisare(k);
else
back(k+1);
}
}
int main()
{
in>>n>>m;
back(1);
return 0;
}