Codeforces C. Malek Dance Club 数学,二进制LCP

题意:编号为[0,2^n-1],问存在多少对编号(a,b)满足 a<b&& a^x > b^x 
给出长度为n的二进制数x 答案模1e9+7.  1<=n<=100


二进制x中为0的位 进行异或时显然没有什么意义 
对n==5的所有x进行打表 观察答案和1的个数是否存在规律?

打表得 答案和(n,x)的关系为 ans=x*(2^(n-1))


正解:

若a<b, a^x>b^x    枚举a^x>b^x第一次发生的位置.

显然不可能出现在s[i]==0的位置.

若s[i]=='1' 那么(a,b) 的[0,i-1]位必须相同 a的第i位为0,b的第i位为1 ,[i+1,n-1]位任意取 所以(a,b)的对数为 2^i * 2^(2*(n-i-1))

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e3+5,mod=1e9+7;
bool vis[N];
int c[N],n=4;
void table()
{
	for(int x=0;x<(1<<n);x++)
	{
		memset(vis,0,sizeof(vis));
		memset(c,0,sizeof(c));
		ll y=x,one=0,cnt=0;
		while(y)
		{
			if(y&1)
				one++;
			y/=2;	
		}
		for(int i=(1<<n)-1;i>=0;i--)
		{
			c[i^x]++;
			for(int j=0;j<(i^x);j++)
				cnt+=c[j];
		}
	//	cout<<x<<' '<<one<<' '<<cnt<<endl;
	}
}
ll pw[N];
int main()
{
	// ans= x*2^(n-1)
	pw[0]=1;
	for(int i=1;i<N;i++)
		pw[i]=(pw[i-1]*2ll)%mod;
	string s;
	cin>>s;
	ll x=0,n=s.length();
	for(int i=0;s[i];i++)
	{
		if(s[i]=='1')
			x=(x+pw[n-i-1])%mod;	
	}
	x=(x*pw[n-1])%mod;
	cout<<x<<endl;
		
	return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
The problem statement can be found at Codeforces website. Approach: Let's start by looking at some examples: - 1, 2, 3, 4, 5 → No moves needed. - 2, 1, 3, 5, 4 → One move needed: swap index 1 and 2. - 5, 4, 3, 2, 1 → Two moves needed: swap index 1 and 5, then swap index 2 and 4. We can observe that in order to minimize the number of moves, we need to sort the array in non-descending order and keep track of the number of swaps we make. We can use bubble sort to sort the array and count the number of swaps. Let's see how bubble sort works: - Start from the first element, compare it with the second element, and swap them if the second element is smaller. - Move to the second element, compare it with the third element, and swap them if the third element is smaller. - Continue this process until the second-to-last element. At this point, the largest element is in the last position. - Repeat the above process for the remaining elements, but exclude the last position. In each iteration of the above process, we can count the number of swaps made. Therefore, the total number of swaps needed to sort the array can be obtained by summing up the number of swaps made in each iteration. Implementation: We can implement the above approach using a simple bubble sort algorithm. Here's the code: - First, we read the input array and store it in a vector. - We define a variable to keep track of the total number of swaps made and set it to 0. - We run a loop from the first element to the second-to-last element. - In each iteration of the above loop, we run another loop from the first element to the second-to-last element minus the current iteration index. - In each iteration of the inner loop, we compare the current element with the next element and swap them if the next element is smaller. - If a swap is made, we increment the total number of swaps made. - Finally, we output the total number of swaps made. Time Complexity: The time complexity of bubble sort is O(n^2). Therefore, the overall time complexity of the solution is O(n^2). Space Complexity: We are using a vector to store the input array. Therefore, the space complexity of the solution is O(n). Let's see the implementation of the solution.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值