QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#239687#6558. Allergen TestingFyindTL 0ms3496kbC++201.1kb2023-11-04 22:28:302023-11-04 22:28:31

Judging History

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

  • [2023-11-04 22:28:31]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:3496kb
  • [2023-11-04 22:28:30]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define _ <<" "<<
#define sz(x) ((int) (x).size())
typedef pair<int, int> pii;
typedef long long ll;
#define debug(x) cout<<#x<<':'<<x<<endl;
typedef unsigned long long ull;
const int maxn=1000;
ull ksm(ll a,ll n){
    ll ans=1;
    while(n){
        if(n&1) ans=a*ans;
        a=a*a;
        n>>=1;
    }
    return ans;
}

int main(){
    int T;
    cin>>T;
    while(T--){
        ll n,d;
        cin>>n>>d;
        //debug(n);debug(d);
        //vector<ll> a(n+1);
        //a[0]=1;
        if(n==1){
            cout<<0<<endl;
            continue;
        }
        if(d>=n-1){
            cout<<1<<endl;
        }
        // ll l=1,r=62;
        // while(l<r){
        //     ll mid=(l+r)/2;
        //     if(ksm(d+1,mid)>=n){
        //         r=mid;
        //     }
        //     else l=mid+1;
        // }
        // cout<<l<<endl;
        ll sum=1;
        for(ll i=1;i<n;i++){
            if(sum*(d+1)>=n){
                cout<<i<<endl;
                break;
            }
            sum*=(d+1);
        }
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3496kb

input:

1
4 1

output:

2

result:

ok single line: '2'

Test #2:

score: -100
Time Limit Exceeded

input:

10000
1 1
1000000000000000000 1
1 1000000000000000000
1000000000000000000 1000000000000000000
26615519354743225 163142634
26615519354743225 163142634
26615519354743224 163142634
26615519354743226 163142634
847997831064072529 920867976
847997831064072529 920867976
847997831064072528 920867976
8479978...

output:

0
60
0
1
1
2
2
2
3
2
2
2
3
2
2
2
5
2
2
2
3
2
2
2
4
2
2
2
4
2
2
2
4
2
2
2
8
2
2
2
4
2
2
2
5
3
3
3
5
3
3
3
5
3
3
3
7
3
3
3
4
3
3
3
5
3
3
3
4
3
3
3
6
3
3
3
5
3
3
3
6
3
3
3
4
4
4
4
8
4
4
4
5
4
4
4
8
4
4
4
7
4
4
4
5
4
4
4
6
4
4
4
5
4
4
4
8
4
4
4
5
4
4
4
5
5
5
5
6
5
5
5
6
5
5
5
7
5
5
5
6
5
5
5
7
5
5
5
6
5...

result: