数学题,比较繁琐的是误差和精度
#include <bits/stdc++.h>
using namespace std;
int main() {
double H, S1, V, L, K, n;
cin >> H >> S1 >> V >> L >> K >> n;
double time1 = sqrt((H - K) / 5.0);
double time2 = sqrt(H / 5.0);
int sum = 0;
double dist1 = S1 - time2 * V, dist2 = S1 + L - time1 * V;
if(dist1 < 0)
dist1 = 0;
if(dist2 > n)
dist2 = n;
if(dist1 > dist2)
dist1 = dist2;
cout << (int)dist2 - (int)dist1 << endl;
return 0;
}
赛瓦维斯特定理:a,b > 1 gcd(a, b) == 1 使得ax + by = c的最大无整数解C的取值为 a * b - a - b
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, res = INT64_MIN;
cin >> n >> m;
cout << n * m - n - m << endl;
return 0;
}