#include<iostream> #include<algorithm> #include<cmath> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<set> #include<unordered_set> #include<unordered_map> using namespace std; #define ll long...

https://ac.nowcoder.com/acm/contest/86387/F #include<iostream> #include<algorithm> #include<cmath> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<set> #include<unordered_set> #include<unordered_...

对于C题的证明本人的拙见，如有错误还请网友指正。 #include<bits/stdc++.h> using namespace std; #define ll long long #define all(x) (x).begin(),(x).end() int T; ll a,b,l,r; /* 最大次数y满足 r*y>=t，并且次数l*y<=t，否则无法组成t，因为操作y-1次以下和y+1次以上均不会满足。 满足上述条件下，最小次数x=t/l，下证x*r>=t，也就是说t位于[x*l,x*r]，操作次数最小是x次 现有条件 => r*y>=t,l*...