#include<iostream> using namespace std; int main(){ long long n,m; cin>>n>>m; long long sum=0; if(n<=m){ for(int i=n,j=m;i>0;i--,j--){ sum+=i*j; }

#include <iostream> using namespace std; int main(){ long long a,b,c = 0; cin >> a >> b; if (a <= b){ for (int i = a,j = b;i > 0;j--,i--){ c += j * i; }

m,n = map(int,input().split()) result = 0 size = min(m,n) for k in range(1,size+1): result += (m - k + 1) * (n - k + 1) print(result)

#include<iostream> using namespace std; int main(){ long long n,m; cin>>n>>m; long long sum=0; if(n<=m){ for(int i=n,j=m;i>0;i--,j--){ sum+=i*j; } else{ for(int i=n,j=m;j>0;i--,j--){ sum+=i*j; } } cout<<sum; return 0; }

n,m = map(int,input().split()) min_side = min(n, m) # 找长和宽的最小值 z_sum = 0 for i in range(min_side): o_sum = (n - i) * (m - i) # 利用数学公式计算正方形的总数 z_sum += o_sum print(z_sum)

#include <iostream> using namespace std; int main(){ int n,m; cin>>n>>m; int count =0; for (int k = 1; k <= min(n, m); k++) { for(int i=0; i<=n-k;i++){ for(int l=0;l<=m-k;l++){ count ++; } } } cout << count << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ long a,b,c,d=0,e=0; cin >> a >> b; if(a < b){ c = a; }else{ c = b; } for(int i = 0;i <= c;++i){ d = d + (a - i) * (b - i); }

#include <iostream> using namespace std; int main() { long long n,m,x=0; cin >> n >> m; for(int i=n,j=m;min(i,j)>0;i--,j--) x+=i*j; cout<<x; return 0; }

#include<iostream> using namespace std; int main() { int kn,km; int n,m,cnt=0; cin>>n>>m; kn=n; km=m; for(int i=1;i<=min(n,m);i++) { cnt+=kn*km; kn--; km--; } cout<<cnt; } 记得点赞+关注

#include <iostream> using namespace std; int main() { long long n,m,x=0; cin >> n >> m; for(int i=n,j=m;min(i,j)>0;i--,j--) x+=i*j; cout<<x; return 0; }

#include<stdio.h> int main(){ }

#include<bits/stdc++.h> using namespace std; int main(){ int n,m,sum = 0; cin >> n >> m; while(n>0 && m>0){ sum += n*m; n--; m--; } cout << sum; return 0; }