HDOJ 2095 find your present (2)
来源:互联网 发布:php怎么写网页自动点击 编辑:程序博客网 时间:2024/06/05 06:50
题意:给出2K+1个数,除了一个数之外,其他的数的个数都以2的倍数出现,求单独数的个数。
链接:http://acm.hdu.edu.cn/showproblem.php?pid=2095
思路:数据范围太大没法开数组统计,因为其他每个数字都存在两个及其2的倍数,利用异或操作可以获得单个的值
注意点:无
以下为AC代码:
Run IDSubmit TimeJudge StatusPro.IDExe.TimeExe.MemoryCode Len.LanguageAuthor132332572015-03-24 22:04:17Accepted2095436MS1628K2778 BC++luminous11#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <iostream>#include <cstring>#include <cstdio>#include <string>#include <vector>#include <deque>#include <list>#include <map>#include <set>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <cctype>#include <climits>#include <iomanip>#include <cstdlib>#include <algorithm>//#include <unordered_map>//#include <unordered_set>#define ll long long#define ull unsigned long long#define all(x) (x).begin(), (x).end()#define clr(a, v) memset( a , v , sizeof(a) )#define pb push_back#define RDI(a) scanf ( "%d", &a )#define RDII(a, b) scanf ( "%d%d", &a, &b )#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )#define RS(s) scanf ( "%s", s )#define PI(a) printf ( "%d", a )#define PIL(a) printf ( "%d\n", a )#define PII(a,b) printf ( "%d %d", a, b )#define PIIL(a,b) printf ( "%d %d\n", a, b )#define PIII(a,b,c) printf ( "%d %d %d", a, b, c )#define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )#define PL() printf ( "\n" )#define PSL(s) printf ( "%s\n", s )#define rep(i,m,n) for ( int i = m; i < n; i ++ )#define REP(i,m,n) for ( int i = m; i <= n; i ++ )#define dep(i,m,n) for ( int i = m; i > n; i -- )#define DEP(i,m,n) for ( int i = m; i >= n; i -- )#define repi(i,m,n,k) for ( int i = m; i < n; i += k )#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )#define depi(i,m,n,k) for ( int i = m; i > n; i += k )#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )#define READ(f) freopen(f, "r", stdin)#define WRITE(f) freopen(f, "w", stdout)using namespace std;const double pi = acos(-1);template <class T>inline bool RD ( T &ret ){ char c; int sgn; if ( c = getchar(), c ==EOF )return 0; //EOF while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar(); sgn = ( c == '-' ) ? -1 : 1; ret = ( c == '-' ) ? 0 : ( c - '0' ); while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' ); ret *= sgn; return 1;}inline void PD ( int x ){ if ( x > 9 ) PD ( x / 10 ); putchar ( x % 10 + '0' );}const double eps = 1e-10;const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };struct node{ int x, y, cnt; node(){} node( int _x, int _y ) : x(_x), y(_y) {} node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}};struct edge{ int to, wei; edge(){} edge( int _to, int _wei ) : to(_to), wei(_wei) {}};int main(){ int T; while ( RDI ( T ) != EOF && T ){ int ans = 0; int tmp = 0; rep ( i, 0, T ){ RDI ( tmp ); ans ^= tmp; } PIL ( ans ); } return 0;}
0 0
- HDOJ 2095 find your present (2)
- hdoj 2095 find your present (2)
- hdoj.2095 find your present (2) 20140804
- hdoj 2095 find your present (2)
- HDOJ 2095 find your present (2)
- HDOJ find your present (2) 2095
- HDOJ 2095 find your present (2)
- HDOJ 2095-find your present (2)
- HDOJ 2095 find your present (2)
- HDOJ 2095 find your present (2)
- hdoj 1563 Find your present!&&2095 Find your present(2) 异或运算
- hdoj 2095 find your present (2) 【位运算】
- hdoj-2095-find your present (2)【位异或】
- HDOJ 2095 find your present (2) 位运算
- hdoj 2095 find your present (2)【位运算,异或】
- HDOJ 2095 Find your present (2) 异或运算
- hdoj 2095 find your present (2)(异或运算)
- 异或的性质 HDOJ 2095 find your present (2)
- Date
- JAE新建应用失败SAE搭建微信公众平台token验证失败
- C/C++中extern关键字详解
- 第六届蓝桥杯省赛C/C++-B 全解析
- Set Matrix Zeroes -- leetcode
- HDOJ 2095 find your present (2)
- esp8266透明模式简述
- Factorial Trailing Zeroes--LeetCode
- JSON
- 一个maven错误:org/apache/maven/shared/filtering/MavenFilteringException
- C# 基于MySQL的数据层基类(MySQLHelper)
- spring framework web @Scheduled 执行两次的问题
- android 用Achartengine 作曲线图
- Windows下Memcache环境的搭建及简单使用(包含 APACHE+PHP+MYSQL 环境配置 )