Cod sursa(job #2166839)
Utilizator | Data | 13 martie 2018 19:08:50 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
int x[20];
void Back(int k, int j)
{
if(k==m)
{
for(int i=0; i<m; ++i) fout<<x[i]<<" ";
fout<<"\n";
return ;
}
for(int i=j+1; i<=n; ++i)
{
x[k]=i;
Back(k+1, i);
}
}
int main()
{
fin>>n>>m;
Back(0, 0);
return 0;
}