AtCoder 213th ABC

A - Bitwise Exclusive Or

        签到题，介绍or或异运算(XOR),该运算又叫不进位加法：对于每一位，只有二者1 0互异时才为1，对应运算符为 ^，故直接输出 a ^ b

https://atcoder.jp/contests/abc213/tasks/abc213_a

#include <cstdio>

int main()
{

        int a, b; scanf("%d %d", &a, &b);

        printf("%d\n", a ^ b); return 0;

}

B - Booby Prize

        签到题，输出第二大的数的下标

https://atcoder.jp/contests/abc213/tasks/abc213_b

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> PII;

const int MOD = 1e9 + 7;
const int N = 2e5 + 10;

int n;
int ans;  //exactly you can get the answer
int a[N];

map<int, int> mp;

int main()
{
    int n; scanf("%d", &n);
    
    for (int i = 1; i <= n; i ++)
    {
        scanf("%d", &a[i]); 
        mp[a[i]] = i;
    }
    
    sort(a + 1, a + 1 + n);
    
    
    printf("%d", mp[a[n - 1]]);
    
    return 0;
}