Pagini recente » Cod sursa (job #1164411) | Cod sursa (job #453586) | Cod sursa (job #238874) | Cod sursa (job #1045827) | Cod sursa (job #1721847)
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int n, m, a[100];
int verificare(int k)
{
int i;
for (i = 1; i < k; i++)
{
if (a[i] == a[k])
return 0;
if (a[i] > a[k])
return 0;
}
return 1;
}
void afisare(int k)
{
FILE *g;
int i;
g = fopen("combinari.out", "a+");
for (i = 1; i < k; i++)
fprintf(g,"%d", a[i]);
fprintf(g,"\n");
}
void back(int k)
{
int i;
if (k == m+1)
{
afisare(k);
}
else
{
for (i = 1; i <= n; i++)
{
a[k] = i;
if (verificare(k) == 1)
back(k + 1);
}
}
}
void main()
{
FILE *f;
f = fopen("combinari.in", "r");
fscanf(f, "%d%d", &n, &m);
back(1);
}