Pagini recente » Cod sursa (job #547505) | Cod sursa (job #28096) | Cod sursa (job #522982) | Cod sursa (job #3257741) | Cod sursa (job #1313915)
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[16],n,p;
int verific(int k)
{
int i=0;
for(i=1;i<k;i++)
if(x[i]>=x[k])
return 0;
return 1;
}
void bkt(int k)
{
int i=0;
if(k==n+1)
{
for(i=1;i<=n;i++)
if(x[i])
g<<i<<" ";
g<<"\n";
}
else
{
x[k]=-1;
while(x[k]<1)
{
x[k]++;
bkt(k+1);
}
}
}
int main()
{
f>>n;
bkt(1);
return 0;
}