QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #208065 | #6558. Allergen Testing | Thallium54# | TL | 0ms | 3588kb | C++20 | 501b | 2023-10-09 05:05:12 | 2023-10-09 05:05:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>
const int N = 1e5 + 100;
const int inf = 1e9;
const ll mod = 9302023;
int main()
{
int q;
cin >> q;
while(q--)
{
ll n, d;
cin >> n >> d;
d++;
ll k = 1;
ll pw = d;
while(pw < n)
{
pw *= d;
k++;
}
cout << k << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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:
1 60 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 5...