题解 | 绝命沙虫

#include<iostream>
#include<algorithm>
using namespace std;
#define int long long
void solve()
{
    int n;
    double m;
    int red=0,green=0;
    cin>>n>>m;
    int exp=0;
    while(n!=0)
    {
        red+=n*100;
        int m1=10000,m2=(m*100-100)*n;
        green+=min(m1,m2);
        n-=n;
        n+=red/200;
        exp+=red/10+green/10;
        red=0,green=0;
    }
    cout<<exp<<endl;
}
signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}