Cod sursa(job #1319396)
Utilizator | Data | 16 ianuarie 2015 22:23:15 | |
---|---|---|---|
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[20],n,m;
void Afisare(int k)
{
int i;
for(i=1;i<=m;i++) fout<<x[i]<<" ";
fout<<"\n";
}
void back(int k)
{
if(k-1==m) Afisare(k);
else
for(int i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
back(k+1);
}
}
int main()
{
fin>>n>>m;
back(1);
return 0;
}