QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #629739 | #5115. Clone Ranran | Diverbee# | AC ✓ | 86ms | 3716kb | C++14 | 372b | 2024-10-11 14:32:45 | 2024-10-11 14:32:47 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MAX = 1e12;
int main(){
int T;
cin>>T;
while(T--)
{
ll a,b,c;
cin>>a>>b>>c;
ll an=1e18;
for(ll i=1,j=0;i<=MAX;i<<=1,j++)
{
an= min(an,j*a+(c+i-1)/i*b);
}
cout<<an<<endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3716kb
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: 86ms
memory: 3688kb
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