Pagini recente » Cod sursa (job #3279095) | Cod sursa (job #2458523) | Cod sursa (job #510235) | Cod sursa (job #1560631) | Cod sursa (job #337677)
Cod sursa(job #337677)
#include <stdio.h>
FILE *f,*g;
long a[1002],b[1002],sol[1002],i,j,n,m,k;
long dusmani(){
for(i=1;i<=n-1;i++)
for(j=1;j<=m;j++)
if(sol[i]==a[i]&&sol[i+1]==b[j])
return 1;
return 0;
}
void afis(){
for(i=1;i<=n;i++)
fprintf(g,"%ld ",sol[i]);
fprintf(g,"\n");
}
void back(long x){
if(x>n){
if(!dusmani){
k--;
if(k==0){
afis;
return;
}
}
}
else
for(i=sol[i-1]+1;i<=n;i++){
sol[k]=i;
back(k+1);
}
}
int main(){
f=fopen("dusman.in","r");
g=fopen("dusman.out","w");
fscanf(f,"%ld%ld%ld",&n,&k,&m);
for(i=1;i<=m;i++)
fscanf(f,"%ld%ld",&a[i],&b[i]);
sol[0]=0;
back(1);
fclose(f);
fclose(g);
return 0;
}