Cod sursa(job #3283849)
Utilizator | Data | 10 martie 2025 16:32:48 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
#define MOD 104659
using namespace std;
///aproapeperm
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, K;
int st[20], top;
void Back(int top)
{
if (top == K + 1)
{
for (int i = 1; i < top; i++)
fout << st[i] << " ";
fout << "\n";
}
else for (int i = st[top - 1] + 1; i <= N; i++)
{
st[top] = i;
Back(top + 1);
}
}
int main()
{
fin >> N >> K;
Back(1);
return 0;
}