n 길이의
boolean combination 출력
#include <stdio.h>
void printboolean(int a[],int index, int n)
{
int i;
if (index == n)
{
for (i=0;i<n;i++){
if (a[i] == 1)
printf ("true ");
else
printf("false ");
}
printf ("\n");
return;
}
a[index]=1;
printboolean(a,index+1,n);
a[index]=0;
printboolean(a,index+1,n);
}
int main(void)
{
int n;
int arr[1000]={0,};
scanf("%d",&n);
printboolean(arr,0,n);
}
'자료구조' 카테고리의 다른 글
| simple adjacency list (0) | 2015.05.22 |
|---|---|
| hash simple linear (0) | 2015.05.22 |
| binary search tree ( insert, kth smallest, inorder, delete by key) (0) | 2015.05.15 |
| link list(single) (0) | 2015.05.01 |


