Jzzhu and Children
来源:互联网 发布:mac os 修改开机密码 编辑:程序博客网 时间:2024/05/17 07:51
Description
There are n children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from1 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 thei-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:
- Give m candies to the first child of the line.
- If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home.
- 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 containsn integers a1, a2, ..., an(1 ≤ ai ≤ 100).
Output
Output a single integer, representing the number of the last child.
Sample Input
5 21 3 1 4 2
4
6 41 1 2 2 3 3
6
Hint
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<algorithm>using namespace std;int main(){ int n,m,i,a,max,k,t; while(cin>>n>>m){ k=0; for(i=0;i<n;i++){ cin>>t;; if(t%m){ a=t/m+1; } else{ a=t/m; } if(i==0){ max=a; k=i+1; } else{ if(max<=a) { max=a; k=i+1; } } } cout<<k<<endl; } return 0;}
- A. Jzzhu and Children
- Jzzhu and Children
- A. Jzzhu and Children
- Jzzhu and Children
- codeforces-DIV2-A-Jzzhu and Children
- (CF#257)A. Jzzhu and Children
- Jzzhu and Children - CF 450A 水题
- Codeforces 450A Jzzhu and Children
- CodeForces 450-A. Jzzhu and Children
- Codeforces 450A Jzzhu and Children(水题)
- A. Jzzhu and Children (周赛4)
- 【CF 450A】 Jzzhu and Children
- codeforces 450A Jzzhu and Children
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- Codeforces Round #257 (Div. 2)1A Jzzhu and Children
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- cf #257(Div.2) A. Jzzhu and Children
- Codeforces Round #257 (Div. 2)A. Jzzhu and Children
- android学习之路1
- 基于IoT平台-开发快的智能温室监控设备设计
- myeclipse2014版安装freemarker IDE
- PHP 转义字符
- php开启websocket端口程序开启模式
- Jzzhu and Children
- 10、叠加管理
- code[VS]1205
- DNS污染和劫持
- 拍照、选择照片功能的实现
- NVMe SSD minor number 数量 64?
- node + mongodb建站
- 在Android程序中使用已有的SQLite数据库
- PHP在线投稿审稿系统