Pagini recente » Clasament moisil_again | Cod sursa (job #2413519) | Cod sursa (job #2852176) | Cod sursa (job #1887997) | Cod sursa (job #1782047)
#include <cstdio>
using namespace std;
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
int n, m, v[19];
void print()
{
for (int i = 1; i <= m; i++)
fprintf(g,"%d ",v[i]);
fprintf(g,"\n");
}
int valid(int k)
{
if(k>1 && v[k]<=v[k-1])return 0;
return 1;
}
void back(int k)
{
for (v[k] = 1; v[k] <= n; v[k]++)
if (valid(k))
if (k == m)
print();
else
back(k + 1);
}
int main()
{
fscanf(f,"%d%d",&n,&m);
back(1);
fclose(f);fclose(g);
return 0;;
}