Cod sursa(job #1275656)
Utilizator | Data | 25 noiembrie 2014 14:16:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[9],n,viz[9],t,m;
void tipar(int k)
{
for(int i=1;i<=k;i++)
{
fout<<x[i]<<' ';
}
fout<<'\n';
}
void back(int k)
{
for(int i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
if(k==m)
tipar(k);
else
back(k+1);
}
}
int main()
{
fin>>n>>m;
back(1);
return 0;
}