QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#168783 | #5115. Clone Ranran | arahato | AC ✓ | 129ms | 3660kb | C++14 | 324b | 2023-09-08 21:56:30 | 2023-09-08 21:56:31 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void doit(){
int a,b,c,ans=2e18;
cin>>a>>b>>c;
for(int i=1,t=0;;t++,i*=2){
ans=min(ans,t*a+((c-1)/i+1)*b);
if(i>c) break;
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);
int t;
cin>>t;
while(t--) doit();
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3644kb
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: 129ms
memory: 3660kb
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