Codeforces Round #461 (Div. 2) B - Magic Forest 异或枚举

题意：

问1~n中 有几个 (i , j , k) 这种三元组，能构成三角形，且 i ^ j ^ k = 0;

思路：

枚举i，j，根据第二个关系得到k = i ^ j；然后判断；

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<list>
#include<stack>
#include<map>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;
const int maxn = 1e5 + 7, maxd = 1e6 + 7;

int n;


int main() {
    kuaidian

    scanf("%d", &n);
    int ans = 0;
    for(int i = 1; i <= n; ++i) {
        for(int j = i + 1; j <= n; ++j) {
            int t = i ^ j;
            if(i+j > t && t >= j && t <= n) {
                //cout << i << " = " << j << " + " << t << endl;
                ans++;
            }
        }
    }
    cout << ans;
    return 0;
}