zoukankan      html  css  js  c++  java
  • (CF#257)A. Jzzhu and Children

    There are n children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from 1 to n. The i-th child wants to get at least ai candies.

    Jzzhu asks children to line up. Initially, the i-th child stands at the i-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:

    1. Give m candies to the first child of the line.
    2. If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home.
    3. Repeat the first two steps while the line is not empty.

    Consider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?

    Input

    The first line contains two integers n, m (1 ≤ n ≤ 100; 1 ≤ m ≤ 100). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 100).

    Output

    Output a single integer, representing the number of the last child.

    Sample test(s)
    input
    5 2
    1 3 1 4 2
    
    output
    4
    
    input
    6 4
    1 1 2 2 3 3
    
    output
    6
    
    Note

    Let's consider the first sample.

    Firstly child 1 gets 2 candies and go home. Then child 2 gets 2 candies and go to the end of the line. Currently the line looks like [3, 4, 5, 2] (indices of the children in order of the line). Then child 3 gets 2 candies and go home, and then child 4 gets 2 candies and goes to the end of the line. Currently the line looks like [5, 2, 4]. Then child 5 gets 2 candies and goes home. Then child 2 gets two candies and goes home, and finally child 4 gets 2 candies and goes home.

    Child 4 is the last one who goes home.


    水题,就不多说了,贴代码吧0.0
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int a[110],num[110];
    int n,m;
    int main()
    {
        while(cin>>n>>m)
        {
            memset(num,0,sizeof(num));
            for(int i=1;i<=n;i++)
            {
                cin>>a[i];
                while(a[i]>0)
                {
                    a[i]-=m;
                    num[i]++;
                }
            }
            int k=1,maxn=0;
            for(int i=1;i<=n;i++)
            {
                if(num[i]>=maxn)//此处注意是>=
                {
                    k=i;
                    maxn=num[i];
                }
            }
            cout<<k<<endl;
        }
        return 0;
    }


  • 相关阅读:
    SQL Server 存储过程中处理多个查询条件的几种常见写法分析,我们该用那种写法
    转:SqlServer2012自增列值突然增大1000的原因及解决方法
    sql server 自增列,值突然增大1000的情况
    C# 复制数组容易踩到的坑--引用类型与值类型
    sql中的表值函数与标量值函数区别与用法
    Swift4.0复习循环
    获取视频第一帧图片
    UITableView实现行纵向颜色渐变
    iOS点击按钮第二次不能旋转View
    iOS扩大按钮的点击范围
  • 原文地址:https://www.cnblogs.com/yjbjingcha/p/6844382.html
Copyright © 2011-2022 走看看