Cod sursa(job #3285878)
Utilizator | Data | 13 martie 2025 15:36:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k, st[1005];
void Afis(int n)
{
for(int i = 1; i <= n; i++)
fout << st[i] << " ";
fout << "\n";
}
void Back(int top)
{
if(top == k + 1)
Afis(k);
else for(int i = st[top - 1] + 1; i <= n; i++)
{
st[top] = i;
Back(top + 1);
}
}
int main()
{
ios_base::sync_with_stdio(0);
fin.tie(0);
fout.tie(0);
int i,j;
fin >> n >> k;
Back(1);
return 0;
}