Pagini recente » Cod sursa (job #90330) | Cod sursa (job #2303888) | Cod sursa (job #1365238) | Cod sursa (job #2851488) | Cod sursa (job #984038)
Cod sursa(job #984038)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int s[19],k,n,p;
int bun()
{
if(s[k]<=s[k-1])
return 0;
else
return 1;
}
int solutie()
{
if(k==p)
return 1;
else
return 0;
}
void afisare()
{
int i;
for(i=1;i<=k;i++)
g<<s[i]<<" ";
g<<endl;
}
void bkt()
{
k=1;
while(k>0)
{
if(s[k]<n)
{
s[k]++;
if(bun())
if(solutie())
afisare();
else
k++;
}
else
{
s[k]=0;
k--;
}
}
}
int main()
{
f>>n>>p;
bkt();
f.close();
g.close();
return 0;
}