Pagini recente » Cod sursa (job #2933885) | Cod sursa (job #1886226) | Cod sursa (job #1834149) | Cod sursa (job #587204) | Cod sursa (job #639158)
Cod sursa(job #639158)
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <fstream.h>
using namespace std;
int st[19],n,k,m;
FILE *f;
int valid(int k,int c)
{
for(int i=0; i<k; i++)
if(st[i] == c)
return 0;
if(st[k-1] > c)
return 0;
return 1;
}
void type(int k)
{
for(int i=0; i<k; i++)
fprintf(f,"%d ", st[i]);
fprintf(f,"\n");
}
void back(int k)
{
if(k == m)
type(k);
else
for(int i=1; i<=n; i++)
if(valid(k,i))
{
st[k] = i;
back(k+1);
}
}
int main()
{
f = fopen("combinari.in","r");
fscanf(f,"%d %d" , &n, &m);
f = fopen("combinari.out","w");
back(0);
// getch();
return 0;
}