题解 | 绝命沙虫

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
    int n;
    double m;
    int sum1=0;
ll min(int x,ll y){
    if(x>y)return y;
    else return x;
}
ll ou(int x){
    ll a1=m*100;
    ll b1=min(10000,x*(a1-100));
    if(x==0)return 0;
sum1=x*10+b1/10+ou(x/2);
return sum1;
}
int main() {
 int t;
 cin>>t;
 while(t--){
    cin>>n>>m;
ll sum=0;
sum=ou(n);
cout<<sum<<endl;
 }   
    return 0;
}