zoukankan      html  css  js  c++  java
  • Codeforces Round #257 (Div. 2) A. Jzzhu and Children

    A. Jzzhu and Children
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.


    题意:n个孩子依次给m个糖果,求最后一个得到满足的孩子的编号。


    #include <cstdio>
    #include <iostream>
    #include <algorithm>
    #include <cmath>
    #include <cstring>
    #include <stdlib.h>
    using namespace std;
    int a[110];
    int l[110];
    int b[110];
    int main(){
        int n,m;
        scanf("%d%d",&n,&m);
        memset(l,0,sizeof l);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            b[i]=a[i];
        }
        int j=0;
        sort(b+1,b+n+1);
        int temp=b[n]/m+1;
        while(temp--){
        for(int i=1;i<=n;i++){
            if(a[i]>0&&m>=a[i]){
                l[j++]=i;
                a[i]-=m;
            }
            else{
                a[i]-=m;
            }
            if(j==n) break;
        }
        if(j==n) break;
        }
        printf("%d",l[n-1]);
        return 0;
    }




    
  • 相关阅读:
    加快火狐启动速度的几种方法 Leone
    我国的社保到底是多交好,还是少交好? Leone
    “情商”和“智商”究竟有哪些区别? Leone
    Atitti 知识图谱构建方法attilax 总结
    Atitit 知识图谱的数据来源
    Atitit java 二维码识别 图片识别
    Atitit 跨平台异常处理(2)异常转换 java c# js异常对象结构比较and转换
    Atitit 异常机制与异常处理的原理与概论
    Atitti knn实现的具体四个距离算法 欧氏距离、余弦距离、汉明距离、曼哈顿距离
    屏幕取词技术实现原理
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/4278706.html
Copyright © 2011-2022 走看看