QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #418740 | #5115. Clone Ranran | quailm14 | AC ✓ | 29ms | 3828kb | C++14 | 251b | 2024-05-23 15:28:11 | 2024-05-23 15:28:11 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
long long T,a,b,c,t,S;
int main(){scanf("%d",&T); while(T--){
scanf("%d%d%d",&a,&b,&c); t=1; S=1e18;
for(int i=0;i<=30;i++,t*=2)
S=min(S,a*i+b*((c-1)/t+1));
printf("%lld\n",S);} return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3720kb
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: 29ms
memory: 3828kb
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