Cod sursa(job #2704970)
Utilizator | Data | 11 februarie 2021 18:29:18 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream be("combinari.in");
ofstream ki("combinari.out");
int a[20],n,k;
void bt(int j)
{
if(j==k)
{
for(int x=1;x<=k;x++){
ki<<a[x]<<" ";
}
ki<<endl;
}
else {
for(int i=a[j]+1;i<=n;i++)
{
a[j+1]=i;
bt(j+1);
}
}
}
int main()
{
be>>n>>k;
bt(0);
return 0;
}