2095 find your present (2)
来源:互联网 发布:淘宝店铺水印素材 编辑:程序博客网 时间:2024/05/18 06:49
#include<iostream>#include<map>#include<cstdio>using namespace std;int main(void){ int n; int temp; map<int,int> m; while(scanf("%d",&n)!=EOF) { if(n==0) { break; } m.clear(); for(int i=0;i<n;i++) { scanf("%d",&temp); m[temp]++; } for(map<int,int>::iterator it=m.begin();it!=m.end();it++) { if(it->second%2!=0) { cout<<it->first<<endl; } } } return 0;}
- hdu-2095-find your present (2)//1563-find your present
- 2095 find your present (2)
- 2095:find your present (2)
- 2095 find your present (2)
- find your present (2) 2095 *
- [2095]:find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present(2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- 继续聊WPF——依赖项属性(3)
- random GB2312 in python
- android开发环境建立以及开发工具的使用--怎样使用eclipse来开发android源码
- 我思故我在系列—数据结构NO.33,NO.34(题目搜集整理者JULY,非常感谢!!)
- Southbound Vertigo Parkway (Lyrics)
- 2095 find your present (2)
- 性能测试
- Linux 系统 如何安装bin 文件 (English)
- 用C++实现插件体系结构
- lucene对数据库创建索引时报错:java.io.IOException: Cannot overwrite: D:\index\_3.fdt的解决办法
- 实现链表逆序
- 如何正确使用环境变量LD_LIBRARY_PATH
- .net中的app.config
- 没积分了