Cod sursa(job #2428354)
Utilizator | Data | 4 iunie 2019 21:22:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n,k,pas,s[20];
void backtracking(int pas)
{
if (pas==k+1)
{
for (int i=1; i<=k; ++i)
cout<<s[i]<<" ";
cout<<"\n";
return;
}
for (int i=s[pas-1]+1; i<=n; ++i)
{
s[pas]=i;
backtracking(pas+1);
}
}
int main()
{
cin>>n>>k;
backtracking(1);
}