Cod sursa(job #2703183)
Utilizator | Data | 7 februarie 2021 15:45:31 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int n,k;
int st[25];
void Back(int top)
{
if(top==k+1)
{
for(int i=1;i<=k;i++)
out<<st[i]<<" ";
out<<'\n';
return;
}
for(int i=st[top-1]+1;i<=n;i++)
{
st[top]=i;
Back(top+1);
}
}
int main()
{
in>>n>>k;
Back(1);
return 0;
}