← 返回题目
题库练习 Triangles
← 上一题 下一题 →

A7768 | Triangles

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Little Petya likes to draw. He drew $N$ red and $M$ blue points on the plane in such a way that no three points lie on the same line. Now he wonders what is the number of distinct triangles with vertices in red points which do not contain any blue point inside.

输入格式

The first line contains two non-negative integer numbers $N$ and $M$ ( $0<=N<=500$ , $0<=M<=500$ ) — the number of red and blue points respectively. The following $N$ lines contain two integer numbers each — coordinates of red points. The following $M$ lines contain two integer numbers each — coordinates of blue points. All coordinates do not exceed $10^{9}$ by absolute value.

输出格式

Output one integer — the number of distinct triangles with vertices in red points which do not contain any blue point inside.

输入输出样例

输入 #1
4 1
0 0
10 0
10 10
5 4
2 1
输出 #1
2
输入 #2
5 5
5 10
6 1
8 6
-6 -7
7 -1
5 -1
10 -4
-10 -8
-10 5
-2 -8
输出 #2
7
C++ 编辑器
输入
输出