Pagini recente » Cod sursa (job #537007) | Cod sursa (job #1973100) | Cod sursa (job #1583758) | Cod sursa (job #446365) | Cod sursa (job #803638)
Cod sursa(job #803638)
#include<stdio.h>
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
int n,p,st[100];
int sol(int k)
{
if (k==p) return 1;
return 0;
}
int verif(int k)
{
int i;
for (i=1;i<k;i++)
if (st[k]==st[i]) return 0;
if (k!=1) if (st[k]<=st[k-1]) return 0;
return 1;
}
void afis()
{
for (int i=1;i<=p;i++)
fprintf(g,"%d ",st[i]);
fprintf(g,"\n");
}
void back(int k)
{
int i;
for (i=1;i<=n;i++)
{
st[k]=i;
if (verif(k))
if (sol(k)) afis();
else back(k+1);
}
}
int main()
{
st[1]=1;
fscanf(f,"%d %d",&n,&p);
back(1);
}