117. Single Number

最新推荐文章于 2022-07-02 13:41:47 发布

Glory232

最新推荐文章于 2022-07-02 13:41:47 发布

阅读量181

点赞数

分类专栏： BUPT Excited OJ

本文链接：https://blog.csdn.net/Glory232/article/details/79719708

版权

BUPT Excited OJ 专栏收录该内容

23 篇文章 1 订阅

订阅专栏

#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
map<unsigned long long int, int> M;
int main(void) {
	int n;
	while (scanf("%d", &n) != EOF) {
		M.clear();
		while (n--) {
			unsigned long long int tmp;
			scanf("%llu", &tmp);
			if (M.find(tmp) == M.end()) {
				M[tmp] = 1;
			} else ++M[tmp];
		}
		for (map<unsigned long long int, int>::iterator itor = M.begin(); itor != M.end(); ++itor) {
			if (itor->second != 3) {
				printf("%llu\n", itor->first);
				break;
			}
		}
	}
	return 0;
}