O(n)级的P2431
  • 板块灌水区
  • 楼主byh123bc
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/9/7 16:07
  • 上次更新2024/9/7 16:36:21
查看原帖
O(n)级的P2431
1211039
byh123bc楼主2024/9/7 16:07

Code:Code :

#include<bits/stdc++.h>
using namespace std;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	unsigned long long a,b,book[70],now=0;
	int ans=0;
	cin>>a>>b;
	book[1]=1;
	for(int i=2;i<=64;i++){
		book[i]=book[i-1]*2;
//		cout<<book[i]<<" ";
	}
//	cout<<endl;
	for(int i=64;i>0;i--){
		if(now+book[i]-1>=a&&now+book[i]-1<=b){
			ans+=(i-1);
			break;
		}
		if(now+book[i]<=b){
			now+=book[i];
			ans++;
		}
	}
	cout<<ans;
	return 0;
}

如有不正确的地方,请神犇指正

2024/9/7 16:07
加载中...