QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#739566 | #5115. Clone Ranran | YangHyyy | AC ✓ | 84ms | 3712kb | C++23 | 417b | 2024-11-12 22:13:48 | 2024-11-12 22:13:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int a,b,c;
cin>>a>>b>>c;
int x=1,ans=c*b,cnt=0,num=0;
while(x<=100*c)
{
cnt=c/x*b+num;
if(c%x!=0)cnt+=b;
//if(c%b!=0)cnt+=b;
ans=min(ans,cnt);
x*=2;
num+=a;
//cnt=c/x*b;
//ans=min(ans,cnt+num);
}
cout<<ans<<endl;
}
signed main()
{
int t;
cin>>t;
while(t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
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: 84ms
memory: 3712kb
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