A11444 | Book Reading
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Recently Luba bought a very interesting book. She knows that it will take $t$ seconds to read the book. Luba wants to finish reading as fast as she can.
But she has some work to do in each of $n$ next days. The number of seconds that Luba has to spend working during $i$ -th day is $a_{i}$ . If some free time remains, she can spend it on reading.
Help Luba to determine the minimum number of day when she finishes reading.
It is guaranteed that the answer doesn't exceed $n$ .
Remember that there are 86400 seconds in a day.
But she has some work to do in each of $n$ next days. The number of seconds that Luba has to spend working during $i$ -th day is $a_{i}$ . If some free time remains, she can spend it on reading.
Help Luba to determine the minimum number of day when she finishes reading.
It is guaranteed that the answer doesn't exceed $n$ .
Remember that there are 86400 seconds in a day.
输入格式
The first line contains two integers $n$ and $t$ ( $1<=n<=100$ , $1<=t<=10^{6}$ ) — the number of days and the time required to read the book.
The second line contains $n$ integers $a_{i}$ ( $0<=a_{i}<=86400$ ) — the time Luba has to spend on her work during $i$ -th day.
The second line contains $n$ integers $a_{i}$ ( $0<=a_{i}<=86400$ ) — the time Luba has to spend on her work during $i$ -th day.
输出格式
Print the minimum day Luba can finish reading the book.
It is guaranteed that answer doesn't exceed $n$ .
It is guaranteed that answer doesn't exceed $n$ .
输入输出样例
输入 #1
2 2 86400 86398
输出 #1
2
输入 #2
2 86400 0 86400
输出 #2
1
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted