Pagini recente » Cod sursa (job #1489344) | Cod sursa (job #3141383) | Cod sursa (job #86697) | Cod sursa (job #2987705) | Cod sursa (job #1601169)
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,p,s[20],use[20];
void Back(int k)
{ int i;
if (k==p+1) {for(i=1;i<=p;i++) g<<s[i]<<" "; g<<"\n";}
else
{
for(i=s[k-1]+1;i<=n;i++)
if (!use[i])
{ use[i]=1;
s[k]=i; Back(k+1);
use[i]=0;
}
}
}
int main()
{
f>>n>>p;
Back(1);
return 0;
}