A. Arya and Bran
来源:互联网 发布:电脑windows壁纸 编辑:程序博客网 时间:2024/05/16 15:39
Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies.
At first, Arya and Bran have 0 Candies. There are n days, at the i-th day, Arya finds ai candies in a box, that is given by the Many-Faced God. Every day she can give Bran at most 8 of her candies. If she don't give him the candies at the same day, they are saved for her and she can give them to him later.
Your task is to find the minimum number of days Arya needs to give Bran k candies before the end of the n-th day. Formally, you need to output the minimum day index to the end of which k candies will be given out (the days are indexed from 1 to n).
Print -1 if she can't give him k candies during n given days.
The first line contains two integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10000).
The second line contains n integers a1, a2, a3, ..., an (1 ≤ ai ≤ 100).
If it is impossible for Arya to give Bran k candies within n days, print -1.
Otherwise print a single integer — the minimum number of days Arya needs to give Bran k candies before the end of the n-th day.
2 31 2
2
3 1710 10 10
3
1 910
-1
In the first sample, Arya can give Bran 3 candies in 2 days.
In the second sample, Arya can give Bran 17 candies in 3 days, because she can give him at most 8 candies per day.
In the third sample, Arya can't give Bran 9 candies, because she can give him at most 8 candies per day and she must give him the candies within 1 day.
解题思路:有两个人,在n天中,每天会给一个人a[i]块糖果,这个人会把糖果给另一个人,但最多给8块,问几天后另一个人有k块糖果,水题,模拟一下整个过程即可。
#include<stdio.h>int main(void) {int n, k, sum = 0, rem = 0;scanf("%d %d", &n, &k);for (int i = 1; i <= n; i++) {int box;scanf("%d", &box);rem += box;if (rem >= 8) {sum += 8;rem -= 8;}else {sum += rem;rem = 0;}if (sum >= k) {printf("%d\n", i);return 0;}}printf("-1\n");}
- A. Arya and Bran
- A. Arya and Bran
- Codeforces 839A Arya and Bran (模拟)
- Codeforces #839A: Arya and Bran 题解
- Codeforces 839A-Arya and Bran
- CF428 (2) A. Arya and Bran
- codeforces 839A Arya and Bran
- codeforces 839A 之 Arya and Bran
- Codeforces--839A--Arya and Bran
- Codeforces839A Arya and Bran
- CodeForces839A Arya and Bran
- Codeforces Round #428 (Div. 2) A. Arya and Bran
- Codeforces Round #428 (Div. 2):A. Arya and Bran
- Codeforces Round #428 (Div. 2) A. Arya and Bran
- Codeforces Round #428 (Div. 2) A. Arya and Bran
- Codeforces Round #428 (Div. 2) A. Arya and Bran
- Codeforces Round #428 (Div. 2) && 839A A. Arya and Bran
- Codeforces Round #428 (Div. 2) A. Arya and Bran(【贪心】)
- js递归示例
- SQL比知必会笔记
- js中继承的几种实现方式
- 2017中国大学生程序设计竞赛
- 线程池原理(二):可执行任务及其返回值
- A. Arya and Bran
- 2017-8-19 Struts2学习笔记五
- 扩展kmp模板
- Java泛型
- 1.1java简介.md
- Qt5解决乱码及常量中有换行符
- void空类型指针仅传地址无指向操作
- Android NDK不得不说的秘密
- HTML基础篇