QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#190779 | #5115. Clone Ranran | PHarr# | AC ✓ | 86ms | 3396kb | C++20 | 462b | 2023-09-29 14:07:24 | 2023-09-29 14:07:25 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a , b, c;
int f( int x ){
return a * x + (c + x - 1 ) / x * b - a ;
}
void solve(){
cin >> a >> b >> c;
int res = LLONG_MAX;
for( int i = 0 , t = 1 ; i < 31 ; i ++ , t *= 2 ){
res = min(res , a * i + ( c + t -1) / t * b );
}
cout << res << "\n";
}
int32_t main(){
int T;
for( cin >> T ; T ; T -- )
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3396kb
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: 3356kb
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