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

    解题报告

    没什么好说的,大于m的往后面放,,,re了一次,,,

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    
    using namespace std;
    struct node
    {
        int x,cd;
    }num[1000000];
    int main()
    {
        int n,m,c;
        cin>>n>>m;
        int i;
        for(i=0;i<n;i++)
        {
            cin>>num[i].cd;
            num[i].x=i+1;
        }
        for(i=0;i<n;i++)
        {
            if(num[i].cd>m)
            {
                num[i].cd-=m;
                num[n++]=num[i];
            }
        }
        printf("%d
    ",num[n-1].x);
        return 0;
    }
    


    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.


  • 相关阅读:
    AndroidManifest.xml详细分析
    GoogleMap-------解决不能使用问题
    GoogleMap-------manifest文件配置
    GoogleMap-------Google Play services SDK的下载和配置
    css_兼容IE和FF的写法
    dede如何新建一个ajax服务端输出文件
    js用ajax和不同页面的php互相传值的方法
    js获取多个标签元素的内容,并根据元素的内容修改标签的属性
    网页上记录鼠标的点击次数和一段有用的php代码,自己学习使用
    PHP弹出提示框并跳转到新页面即重定向到新页面
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/4082731.html
Copyright © 2011-2022 走看看