A1309 | [COCI-2013_2014-contest5]#6 TROKUTI
来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0
题目描述
You are given N lines, their equations being Ai x + Bi y + Ci = 0 in the coordinate plane. Calculate the number of triangles whose sides lie on the given lines. Since the result can be very large, output the number modulo 1 000 000 00
7.
Important note: No three lines will intersect at the same point.
7.
Important note: No three lines will intersect at the same point.
输入格式
The first line of input contains the integer N (1 ≤ N ≤ 300 000), the number of lines.
Each of the following N lines contains three integers: Ai , Bi and Ci , the numbers defining the i th line.
All numbers will be lesser than 10^
9.
Each of the following N lines contains three integers: Ai , Bi and Ci , the numbers defining the i th line.
All numbers will be lesser than 10^
9.
输出格式
The first and only line of output must consist of the required number from the task.
输入输出样例
输入 #1
6 0 1 0 -5 3 0 -5 -2 25 0 1 -3 0 1 -2 -4 -5 29
输出 #1
10
输入 #2
5 -5 3 0 -5 -3 -30 0 1 0 3 7 35 1 -2 -1
输出 #2
10
In test cases worth 40% of total points, N will be lesser than 1000.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted