Pagini recente » Cod sursa (job #2096533) | Cod sursa (job #762770) | Cod sursa (job #29511) | Cod sursa (job #1941154) | Cod sursa (job #443747)
Cod sursa(job #443747)
#include<fstream.h>
int n,p,k,x[20];
int posibil(int k)
{int ok,j;
ok=1;
if(x[k]<=x[k-1]) ok=0;
return ok;
}
void scrie()
{int j;
for(j=1;j<=p;j++)
out<<x[j]<<" ";
out<<endl;
}
void adauga(int i)
{
int ok;
while(i>0)
{ok=0;
while((x[i]<n)&&(ok==0))
{x[i]++;
ok=posibil(i);
}
if(ok==0) i--;
else if(i==p) scrie();
else {i++;
x[i]=0;
}
}
}
int main()
{
ifstream in("combinari.in");
ofstream out("combinari.out");
in>>n;
in>>p;
adauga(1);
in.close();
out.close();
return 0;
}