Cod sursa(job #2201970)
Utilizator | Data | 6 mai 2018 20:11:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int i,j,n,k,t[100];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void bk(int l)
{
if (l==k)
{
for (int i=1;i<=k;i++)
fout<<t[i]<<" ";
fout<<"\n";
return;
}
for (int i=t[l]+1;i<=n;i++)
{
t[l+1]=i;
bk(l+1);
}
}
int main()
{
fin>>n>>k;
bk(0);
return 0;
}