QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#490300 | #6558. Allergen Testing | SmallAoPigBigPiPig# | TL | 0ms | 3828kb | C++17 | 411b | 2024-07-25 14:21:31 | 2024-07-25 14:21:32 |
Judging History
answer
#include<bits/stdc++.h>
typedef long long ll;
int main()
{
int task;
scanf("%d",&task);
while(task--)
{
ll n,d;
scanf("%lld%lld",&n,&d);
ll mul=1;
for(ll m=0;;++m)
{
if(mul>=n)
{
printf("%lld\n",m);
break;
}
mul*=d+1;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3828kb
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...