Pagini recente » Cod sursa (job #2324044) | Cod sursa (job #502259) | Cod sursa (job #2056718) | Cod sursa (job #1740950) | Cod sursa (job #556475)
Cod sursa(job #556475)
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
int i,n,x[11],s;
void retsol()
{for(i=1;i<=s;i++)
g<<x[i]<<" ";
g<<"\n";}
int continuare(int k)
{for(i=1;i<k;i++)
if(x[i]>=x[k])
return 0;
return 1;}
void back()
{int k;
k=1;
while(k>0)
if(k==s+1)
{retsol();k--;}
else
if(x[k]<n)
{x[k]++;
if(continuare(k)==1)
k++;}
else
{x[k]=0;k--;}}
int main()
{f.open("combinari.in");
g.open("combinari.out");
f>>n>>s;
back();
f.close();
g.close();}