Pagini recente » Cod sursa (job #1884110) | Cod sursa (job #1790408) | Cod sursa (job #1422349) | Cod sursa (job #870301) | Cod sursa (job #313402)
Cod sursa(job #313402)
#include<cstdio>
using namespace std;
int x[20];
int valid(int k)
{
if (k!=1&&x[k]<=x[k-1])
return 0;
return 1;
}
int main()
{
int n,m,k,i,altul;
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&m);
k=1;
while (k)
{
do
if (x[k]<n)
{
x[k]++;
altul=1;
}
else altul=0;
while(altul&&!valid(k));
if (altul)
if (k==m)
{
for (i=1;i<=m;i++)
fprintf(g,"%d ",x[i]);
fprintf(g,"\n");
}
else
{
k++;
x[k]=0;
}
else
k--;
}
fclose(f);
fclose(g);
return 0;
}