Cod sursa(job #3265660)
Utilizator | Data | 2 ianuarie 2025 11:35:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n;
int k;
int ans[16];
void back(int pas)
{
if(pas != k+1)
{
for(int i=1; i<=n; i++)
{
ans[pas] = i;
if(ans[pas] > ans[pas-1])
back(pas+1);
}
}
else
{
for(int i=1; i<=k; i++)
fout << ans[i] << ' ';
fout << '\n';
}
}
int main()
{
fin >> n >> k;
back(1);
return 0;
}