Codeforces Round #461 (Div. 2) B. Magic Forest

最新推荐文章于 2022-08-21 01:05:54 发布

哇-WA

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量378

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/u013852115/article/details/79292335

版权

动态规划专栏收录该内容

43 篇文章 0 订阅

订阅专栏

Imp is in a magic forest, where xorangles grow (wut?)

$\text{[math]}$

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;
$\text{[math]}$ , where $\text{[math]}$ denotes the bitwise xor of integers x and y.
(a, b, c) form a non-degenerate (with strictly positive area) triangle.

Input

The only line contains a single integer n (1 ≤ n ≤ 2500).

Output

Print the number of xorangles of order n.

        Examples 
      
          input 
        
6

          output 
        
1

          input 
        
10

          output 
        
2

Note

The only xorangle in the first sample is (3, 5, 6).

思路：

看到这一题首先想到了用动态规划的思想来存储最大值为i时的组数。

对于计算满足最大值为i时的组数时，我一开始用了三层循环，然而一定会超时。然后就想到了异或的性质，当c=a^b，那么a^b^c==0.于是就可以根据i和j直接计算出c的值，再判断c是否满足条件就可以了。由于会有重复的三元组，我们可以规定c必须小于j。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stdlib.h>
#include<math.h>
using namespace std;
int n;
long long dp[2505];
int main()
{
scanf("%d",&n);
dp[0]=0;
for(int i=1;i<=n;i++)
{
dp[i]=dp[i-1];
for(int j=1;j<=i;j++)
{
int k=i^j;
if(k+j>i && k<j) dp[i]++;
}
}
printf("%lld\n",dp[n]);
return 0;
}