Cod sursa(job #3316152)
| Utilizator | Data | 17 octombrie 2025 16:30:37 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, p, x[19];
void tipar()
{
for(int i=1; i<=p; i++)
g<<x[i]<<' ';
g<<'\n';
}
void bt(int k)
{
if(k<=p)
for(int i=x[k-1]+1; i<=n-p+k; i++)
{
x[k]=i;
bt(k+1);
}
else tipar();
}
int main()
{
f>>n>>p;
bt(1);
return 0;
}
