QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#693159#7735. Primitive Rootkonghaojie#TL 0ms0kbC++17649b2024-10-31 15:38:212024-10-31 15:38:57

Judging History

你现在查看的是最新测评结果

  • [2024-10-31 15:38:57]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2024-10-31 15:38:21]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
typedef unsigned long long ull;
const ull MAX=4e18;
const int D=500;
void solve(){
	int p,m;cin>>p>>m;
	ull l=0,r=MAX/p;
	while(l<=r){
		int mid=(l+r)>>1;
		int num=(1+r*p)^(p-1);
		if(num>m) r=mid-1;
		else l=mid+1;
	}
	ull ind=r;
	int ans=0;
	l=ind-D,r=ind+D;
	if(l<0) l=0;
	if(r>MAX/p) r=MAX/p;
	for(int i=l;i<=r;i++){
		int num=(1+i*p)^(p-1);
		if(num<=m) ans++;
	}
	ans+=l;
	cout<<ans<<endl;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

詳細信息

Test #1:

score: 0
Time Limit Exceeded

input:

3
2 0
7 11
1145141 998244353

output:


result: