Pagini recente » Cod sursa (job #765048) | Cod sursa (job #1312527) | Cod sursa (job #3158866) | Cod sursa (job #660317) | Cod sursa (job #1411255)
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int j,i,n,a[100],k,cresc;
bool ok;
int main()
{fi>>n>>k;
i=1;
while (i>0)
{ if (i==k+1){ cresc=true;
for (j=1;j<i-1;j++)
if (a[j]>a[j+1]) cresc=false;
if (cresc==true) for (j=1;j<i;j++)
fo<<a[j]<<' ';
if (cresc==true) fo<<endl;
i--; }
else
if (a[i]<n){ a[i]++;
i++;
a[i]=a[i-1];}
else {a[i]=0;
i--;}
}
return 0;
}