Cod sursa(job #3318962)
| Utilizator | Data | 29 octombrie 2025 23:49:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,x[16];
bool valid(int k)
{return (x[k-1]<x[k]);
}
void afis()
{
for(int i=1;i<=m;i++)
g<<x[i]<<' ';
g<<'\n';
}
void backt(int k)
{
if(k<=m)
for(int v=1;v<=n;v++)
{
x[k]=v;
if(valid(k))
backt(k+1);
}
else
afis();
}
int main()
{f>>n>>m;
backt(1);
return 0;
}
