Cod sursa(job #1941295)
Utilizator | rrewrew narto | Data | 27 martie 2017 09:56:46 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[20],uz[20], nr, n, k;
void bk(int nr)
{
int i;
if(nr<=k)
{
for(i=st[nr-1]+1; i<=n; i++)
if(uz[i]==0)
{
st[nr]=i;
uz[i]++;
bk(nr+1);
uz[i]--;
st[nr]=0;
}
}
else
{
for(i=1; i<=k; i++)
g<<st[i]<<' ';
g<<'\n';
}
}
int main()
{
f>>n>>k;
bk(1);
return 0;
}