This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int main ()
{
	long long int n, m;
	scanf ("%lld %lld", &n, &m);
	long long int sol;
	if (n % 2 == 1)
		--n;
	if (m % 2 == 1)
		--m;
	sol = ((m / 2) + 1) * m / 2 - ((n / 2) + 1) * n / 2;
	printf ("%lld", sol);
	return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |