Pagini recente » Cod sursa (job #1003590) | Cod sursa (job #2776707) | Cod sursa (job #1290693) | Cod sursa (job #2327486) | Cod sursa (job #1113015)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int N, used[20], st[20], K;
void afisare()
{
for (int i=1; i<=K; ++i)
g<<st[i]<<' '; g<<'\n';
}
void back(int top)
{
if (top>K) afisare();
for (int i=st[top-1]+1; i<=N; ++i)
if (!used[i])
{
st[top]=i; used[i]=1;
back(top+1);
used[i]=0;
}
}
int main()
{
f>>N>>K;
back(1);
return 0;
}