/* @问题:求{A}-{B}的集合 @Time:20160423-0:35 @Author:Alex */ #include<stdio.h> #include<stdlib.h> void sort(int * string,int length) { int i=0,j=0; int temp=0; for(i=0;i<length-1;i++) { for(j=i+1;j<length j="" if="" string="" i="">*(string+j)) { temp = *(string+j); *(string+j) = *(string+i); *(string+i) = temp; } } } } int main() { int m,n; int count,count1; int mark; int number; int * string = NULL; int * string1 = NULL; while(scanf("%d%d",&n,&m)!=EOF&&(m+n)) { string = (int *) malloc((n)*sizeof(int)); string1 = (int *) malloc((m)*sizeof(int)); if((NULL == string)&&(NULL == string1)) { exit(1); } for(count = 0;count < n;count++) { scanf("%d",string+count); } for(count = 0;count < m;count++) { scanf("%d",string1+count); } sort(string,n); sort(string1,m); number=0; for(count = 0;count < n;count++) { mark = 0; for(count1 = 0;count1 < m;count1++) { if(*(string+count) == *(string1+count1)) { mark = 1; } } if(!mark) { if(count != n) { printf("%d ",*(string+count)); number++; } else { printf("%d",*(string+count)); number++; } } } if(number == 0) { printf("NULL\n"); } else { printf("\n"); } free(string); free(string1); } return 0; }