Xor Sum Gym

来源：互联网发布：mysql和oracle语法区别编辑：程序博客网时间：2024/05/20 04:50

题目链接：https://vjudge.net/problem/Gym-100741D

题意：求n个数中出现次数为奇数次的所有数的异或值。

思路：水题，同一个值，异或两次相当于没有进行异或，所以不用求出现次数为奇数还是偶数，直接全部异或就行。

代码如下：

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<cstdlib>#include<sstream>#include<deque>#include<stack>#include<set>#include<map>using namespace std;typedef long long ll;typedef unsigned long long ull;const double eps = 1e-6;const int  maxn = 1e6 + 50;const int  maxt = 300 + 10;const int mod = 10;const int dx[] = {1, -1, 0, 0};const int dy[] = {0, 0, -1, 1};const int Dis[] = {-1, 1, -5, 5};const int inf = 0x3f3f3f3f;const int MOD = 1000;int n, m, k;int main(){    int n;    scanf("%d", &n);    int ans;    scanf("%d", &ans);    int x;    for(int i = 1; i < n; ++i){        scanf("%d", &x);        ans ^= x;    }    printf("%d\n", ans);    return 0;}

阅读全文

0 0