- #include<stdio.h>
- int stack[15],C[15];
- int main()
- {
- int N;
- while (scanf("%d",&N)!=EOF)
- {
- if (N==0) return 0;
- for (int i=1;i<=N;i++) scanf("%d",&C[i]);
- for (int i=1;i<=N-1;i++)
- for (int j=i+1;j<=N;j++)
- if (C[i]>C[j])
- {
- int tmp=C[i];
- C[i]=C[j];
- C[j]=tmp;
- }
- int T=0;
- for (int i=1;i<=N;i++)
- {
- if (T==0) stack[++T]=C[i];
- else
- {
- if (stack[T]==C[i]) T--;
- else stack[++T]=C[i];
- }
- }
- if (T==0) printf("0\\n");
- else printf("1\\n");
- }
- return 0;
- }
- //该片段来自于http://www.codesnippet.cn/detail/251120137473.html
来源: http://www.codesnippet.cn/detail/251120137473.html