Cod sursa(job #2616952)
| Utilizator | Data | 20 mai 2020 13:37:30 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int v[20], n, k;
void backtracking(int pos)
{
if(pos==k+1)
{
for(int i=1; i<=k; i++)
cout<<v[i]<<' ';
cout<<'\n';
}
else{
for(int val=v[pos-1]+1; val<=n; val++){
v[pos]=val;
backtracking(pos+1);
}
}
}
int main()
{
cin>>n>>k;
backtracking(1);
return 0;
}
