2153.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2153 on 2005-10-31 at 17:34:38 */ 
#include <cstdio>

const int MAX = 1024;

int main()
{
	long final, k[MAX];
	int n, i, p, key;
	
	while(scanf("%d", &n) == 1) {
		if(n == 0) {
			return 0;
		} else {
			final = 0;
			for(i = 0; i < n; i++) {
				scanf("%d", &k[i]);
				final ^= k[i];
			}
			if(final == 0) {
				printf("0\n");
			} else {
				for(p = 0; final != 1; p++) {
					final >>= 1;
				}
				key = 1 << p;
				p = 0;
				for(i = 0; i < n; i++) {
					if((k[i] & key) != 0) {
						p++;
					}
				}
				printf("%d\n", p);
			}
		}
	}
	
	return 0;
}