Magic Forest
Hazrat Ali
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to count the number of distinct xorangles of order n to get out of the forest.
Formally, for a given integer n you have to find the number of such triples (a, b, c), that:
- 1 ≤ a ≤ b ≤ c ≤ n;
, where 
denotes the of integers x and y.- (a, b, c) form a non-degenerate (with strictly positive area) triangle.
The only line contains a single integer n (1 ≤ n ≤ 2500).
Print the number of xorangles of order n.
6
1
10
2
Solution
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int temp = 0;
for (int i = 1; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < i + j and k < n + 1; k++) {
int sum = i xor j xor k;
if (sum == 0) {
temp++;
}
}
}
}
cout << temp << endl;
return 0;
}