Cod sursa(job #2907518)
Utilizator | Data | 30 mai 2022 16:41:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,s[20];
void bkt(int p)
{
/// conditia de oprire
if(p==k+1)
{
for(int i=1;i<=k;i++)
g<<s[i]<<' ';
g<<'\n';
return;
}
/// continuare
for(int j=s[p-1]+1;j<=n;j++)
{
s[p]=j;
bkt(p+1);
}
///pas inapoi
}
int main()
{
f>>n>>k;
bkt(1);
return 0;
}