c++ 数学公式高速算法

just 发表于 3个月前 · 关联问题 守护长方形

include

using namespace std; int main() {

long long N, M; cin >> N >> M; long long sum = N * (N + 1) * M * (M + 1)/4; long long min = (M < N ? M : N); long long z=0; for (long long i = 1; i <= min; i++) { z += (M - i + 1) * (N - i + 1); } cout << z << " " << sum - z; system("pause"); return 0;

}