codeforces 450A Jzzhu and Children

原创 2018年04月15日 20:46:35
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.

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

#include <iostream>
#include <cstring>
using namespace std;
int main(){
    int m,n,ans,maxx=-1,x;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>x;
        int j=x%m==0?x/m:(x/m+1);
        if(j>=maxx){
            maxx=j;
            ans=i;
        }
    }
    cout<<ans<<endl;
    return 0;
}

Codeforces 450A Jzzhu and Children(水题)

题目链接:Codeforces 450A Jzzhu and Children 题目大意:有n个小孩,每个小孩要ai个糖果,现在他们排成一队,逐个领取糖果,你每次只会发m个糖果,没有获得足够糖果...
  • u011328934
  • u011328934
  • 2014-09-24 15:09:49
  • 563

Codeforces 450A Jzzhu and Children

求出每个孩子可以
  • u010863471
  • u010863471
  • 2014-07-21 14:13:21
  • 355

CodeForces 450A 队列

Description There are n children in Jzzhu's school. Jzzhu is going to give some candies to them. ...
  • became_a_wolf
  • became_a_wolf
  • 2015-08-22 14:47:11
  • 759

【CF 450A】 Jzzhu and Children

【CF 450A】 Jzzhu and Children 发糖 n个小盆(屁)友(孩) 站好队 第i个人想要ai颗糖 但坏叔蜀一个人一次只发m个糖 还想要就要到队尾排队 领够糖的就走开 问最后走的小...
  • ChallengerRumble
  • ChallengerRumble
  • 2015-08-22 18:56:07
  • 516

队列模拟

队列之前学的。忘得差不多了。
  • u013594723
  • u013594723
  • 2014-07-20 10:14:39
  • 231

Jzzhu and Children - CF 450A 水题

Jzzhu and Children time limit per test 1 second memory limit per test 256 megabytes ...
  • u014733623
  • u014733623
  • 2014-07-20 11:38:42
  • 497

Codeforces 449B Jzzhu and Cities(最短路)

题目链接:Codeforces 449B Jzzhu and Cities 题目大意:Jzzhu是一个国家的总统,这个国家有N座城市,以1为首都,已经存在了M条公路,给定M条路。并且还有K条铁轨...
  • u011328934
  • u011328934
  • 2014-09-24 15:23:05
  • 1220

codeforces 449D Jzzhu and Numbers 容斥+DP

很有意思的一题,题目大意
  • ACMmaxx
  • ACMmaxx
  • 2014-07-24 12:55:18
  • 1381

CodeForces 449D Jzzhu and Numbers

CodeForces 449D Jzzhu and Numbers
  • X_rotator
  • X_rotator
  • 2017-04-15 10:07:38
  • 238

(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 al...
  • u013582254
  • u013582254
  • 2014-07-20 08:02:35
  • 1082
收藏助手
不良信息举报
您举报文章:codeforces 450A Jzzhu and Children
举报原因:
原因补充:

(最多只允许输入30个字)