CodeForces 450-A. Jzzhu and Children
2014-07-30 14:25
555 查看
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
output
input
output
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.
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.
#include<iostream> #include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> #include<stack> #include<queue> #include<set> #include<map> #include<vector> using namespace std; struct hehe{ int id,value; }a[110]; queue<hehe > q; int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int ans = 0; for(int i = 1;i <= n;i++) { scanf("%d",&a[i].value); a[i].id = i; q.push(a[i]); } while(q.size()>1) { hehe temp = q.front(); q.pop(); if(m >= temp.value) { continue; } else { temp.value -= m; q.push(temp); } } hehe temp2 = q.front(); printf("%d\n",temp2.id); while(!q.empty()) q.pop(); } return 0; }
相关文章推荐
- codeforces-DIV2-A-Jzzhu and Children
- codeforces 450-B Jzzhu and Sequences 矩阵快速幂
- codeforces - 450 - B - Jzzhu and Sequences 【简单的矩阵快速幂】
- Jzzhu and Sequences CodeForces - 450B (矩阵快速幂)
- CodeForces 450-B. Jzzhu and Sequences
- Codeforces 450 C. Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate
- Codeforces 450 B. Jzzhu and Sequences
- Codeforces 450 C. Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate
- codeforces 450A Jzzhu and Children
- Codeforces 450 B. Jzzhu and Sequences
- codeforces 450B B. Jzzhu and Sequences(矩阵快速幂)
- codeforces 450 B Jzzhu and Sequences
- B - Jzzhu and Cities CodeForces - 450D spfa||dijkstra+堆优化
- Codeforces Div. 2 #257-C. Jzzhu and Chocolate
- CodeForces 449 A.Jzzhu and Chocolate(枚举)
- cf #257(Div.2) A. Jzzhu and Children
- A. Jzzhu and Children
- CodeForces 449A - Jzzhu and Chocolate(贪心)