QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#724476 | #5115. Clone Ranran | Yurily# | AC ✓ | 102ms | 3692kb | C++20 | 425b | 2024-11-08 13:18:51 | 2024-11-08 13:18:51 |
Judging History
answer
#include<iostream>
#define ll long long
using namespace std;
ll a,b,c;
ll up_div(ll i,ll j){
ll num=i/j;
if(i%j) num++;
return num;
}
void sol(){
ll num=1,cnt=0;
while(a*cnt+b*up_div(c,num)>a*(cnt+1)+b*up_div(c,num*2)) num*=2,cnt++;
cout<<a*cnt+b*up_div(c,num)<<"\n";
return;
}
int main(){
ll T; cin>>T;
while(T--){
cin>>a>>b>>c;
sol();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3692kb
input:
5 1 1 1 2 3 3 9 9 9 3 26 47 1064 822 1048576
output:
1 7 45 44 21860
result:
ok 5 number(s): "1 7 45 44 21860"
Test #2:
score: 0
Accepted
time: 102ms
memory: 3540kb
input:
99500 1000000000 1000000000 1000000000 1000000000 1000000000 999999999 1000000000 1000000000 999999998 1000000000 1000000000 999999997 1000000000 1000000000 999999996 1000000000 1000000000 999999995 1000000000 1000000000 999999994 1000000000 1000000000 999999993 1000000000 1000000000 999999992 10000...
output:
31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999996 30999999996 30999999996 30999999996 30999999996 ...
result:
ok 99500 numbers