Codeforces Div. 2 #257-A. Jzzhu and Children
2014-07-20 13:37
295 查看
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:
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 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 41 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.
//AC代码
/* 简单模拟题,标记下号码就能AC */ #include<iostream> #include<cstdio> #include<queue> #include<cmath> #include<algorithm> #include<cstring> #include<string> const int Max=101; using namespace std; typedef struct Children { int x; int num; }cd; cd s[Max]; int main() { int n,m,i,j,sum,t; //while(1) //{ cin>>n>>m; sum=n; memset(s,0,sizeof(s)); t=n; for(i=1;i<=n;i++) { cin>>s[i].x; s[i].num=i; s[i].x-=m; if(s[i].x<=0) { s[i].x=0; sum-=1; } } //for(i=1;i<=n;i++) //cout<<s[i].x<<" "; // cout<<endl; //cout<<sum<<endl; while(sum>0) { for(i=1;i<=n;i++) { if(s[i].x>0) { s[i].x-=m; //cout<<"xx"<<endl; if(s[i].x<=0) { //cout<<"ok"<<endl; s[i].x=0; sum-=1; if(sum==0) t=s[i].num; } } if(sum==0) break; } //cout<<sum<<endl; } cout<<t<<endl; //} return 0; }
相关文章推荐
- Codeforces Round #257 (Div. 1) D. Jzzhu and Numbers
- Codeforces Round #257 (Div. 1)449A - Jzzhu and Chocolate(贪心、数学)
- Codeforces Round #257 (Div. 2) B Jzzhu and Sequences
- CF Codeforces Round #257 (Div. 1) A (449A) Jzzhu and Chocolate
- Codeforces Round #257 (Div. 1)B题Jzzhu and Cities(spfa+slf优化)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) E. The Holmes Children
- Codeforces Round #199 (Div. 2) E. Xenia and Tree
- 【Codeforces Round 330 (Div 2)A】【水题】Vitaly and Night 多少间房间有人
- Codeforces Round 281 div2 C Vasya and Basketball
- Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)
- Codeforces Round #394 (Div. 2) B. Dasha and friends 暴力
- Codeforces Round #394 (Div. 2)C. Dasha and Password【暴力】
- Codeforces Round #394 (Div. 2) A. Dasha and Stairs
- Codeforces Round #207 (Div. 2) Xenia and Hamming(字符串匹配)
- Codeforces Round #290 (Div. 1) A. Fox And Names
- Codeforces Round #305 (Div. 2) A. Mike and Fax 暴力回文串
- Codeforces Round #235 (Div. 2) D. Roman and Numbers(状压dp)
- Codeforces Round #250 (Div. 1) D. The Child and Sequence
- Codeforces Round #291 (Div. 2) D. R2D2 and Droid Army RMQ/单调队列/尺取法
- Codeforces Round #371 (Div. 1) D. Animals and Puzzle 二维倍增