Pagini recente » Cod sursa (job #304014) | Cod sursa (job #43242) | Cod sursa (job #1619700) | Cod sursa (job #1087644) | Cod sursa (job #601428)
Cod sursa(job #601428)
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;
const char IN[] = {"dreptunghiuri.in"};
const char OUT[] = {"dreptunghiuri.out"};
const int INF = 1000000005;
const double PI = 3.14159265;
const int NMAX = 405;
#define II inline
#define LL long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) for(int i = a ; i <= b ; i++)
#define IFOR(i, a, b) for(int i = a ; i >= b ; i--)
#define FORIT(it, V) for(vector<int> :: iterator it = V.begin() ; it != V.end() ; it++)
#define all(a) a, a +
int N, M;
LL REZ = 1;
void numara()
{
N--; M--;
REZ *= (N*(N + 1))/2;
REZ *= (M*(M + 1))/2;
for(int i = 2 ; i <= min(N, M) ; i += 2)
REZ += (N - i + 1)*(M - i + 1);
}
int main()
{
freopen(IN, "r", stdin);
freopen(OUT, "w", stdout);
scanf("%d%d", &N, &M);
numara();
printf("%lld\n", REZ);
return 0;
}