zoukankan      html  css  js  c++  java
  • A. Arya and Bran(水题)

    A. Arya and Bran
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.

    Input

    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).

    Output

    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.

    Examples
    Input
    2 3
    1 2
    Output
    2
    Input
    3 17
    10 10 10
    Output
    3
    Input
    1 9
    10
    Output
    -1
    Note

    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.

    绝对的水题.

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 int m[105];
     4 int main(){
     5   int n,k;
     6   scanf("%d%d",&n,&k);
     7   for(int i=1;i<=n;i++){
     8     scanf("%d",&m[i]);
     9   }
    10   int i;
    11   for(i=1;k>0&&i<=n;i++){
    12     if(m[i]<=8)
    13       k-=m[i];
    14     else{
    15       k-=8;
    16       m[i+1]+=m[i]-8;
    17     }
    18   }
    19   if(k<=0)
    20     printf("%d
    ",--i);
    21   else
    22     printf("-1
    ");
    23   return 0;
    24 }
  • 相关阅读:
    SSAS维度成员中的非法XML字符[转]
    Java 的sun.jdbc.odbc桥连接的使用!
    SSAS全半角空格导致的AS处理错误[转]
    【原创】C# 如何自定义代码模版
    TO_DATE函数
    JDK Windows环境变量配置
    SSAS异常字符导致找不到属性键错误[转]
    SQL SERVER 数据库日期算法总结
    章节 2.1 可靠的软件 – 灵活,可靠的软件 使用设计模式和敏捷开发
    软件架构设计和Scrum潜在可交付产品,我(scrum master)和他(架构师)的讨论
  • 原文地址:https://www.cnblogs.com/zllwxm123/p/7354887.html
Copyright © 2011-2022 走看看