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.


  • 相关阅读:
    AngularJS启动过程分析
    mongodb 基本用法大全
    bitbucket工程改名导致 repository does not exist. fatal: Could not read from remote repository.
    分散的配置文件VS集中的注册表
    让browserify接收命令行参数,在打包时parse yml配置文件
    vscode下ts-node传入cli参数
    d3 .each()
    d3选择全部子节点,不知道class和id
    d3 parse字符串形式的xml svg and append to element
    在浏览器端用es6,babel+browserify打包
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/4082731.html
Copyright © 2011-2022 走看看