A1280 | [COCI-2012_2013-contest6]#4 DOBRI
来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0
题目描述
You are given a sequence A consisting of N integers (not to be confused with the sequence from the previous task). We will call the i th sequence element good if it equals the sum of some three elements in positions strictly smaller than i (an element can be used more than once in the sum).
How many good elements does the sequence contain?
How many good elements does the sequence contain?
输入格式
The first line of input contains the positive integer N (1 ≤ N ≤ 5000), the length of the sequence A.
The second line of input contains N space-separated integers representing the sequence A (-100 000 ≤
Ai ≤ 100 000).
The second line of input contains N space-separated integers representing the sequence A (-100 000 ≤
Ai ≤ 100 000).
输出格式
The first and only line of output must contain the number of good elements in the sequence.
输入输出样例
输入 #1
2 1 3
输出 #1
1
输入 #2
6 1 2 3 5 7 10
输出 #2
4
输入 #3
3 -1 2 0
输出 #3
1
In test data worth at least 40% of total points, N ≤ 50.
In test data worth at least 70% of total points, N ≤ 500.
In test data worth at least 70% of total points, N ≤ 500.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted