codeforces 450A Jzzhu and Children
2017-10-26 20:21
281 查看
点击打开链接
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 th
4000
e 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.
Examples
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.
没别的,用队列(queue),感觉这样模拟就可以了。
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 th
4000
e 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.
Examples
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.
没别的,用队列(queue),感觉这样模拟就可以了。
#include<bits/stdc++.h> #include<queue> #include<cmath> using namespace std; typedef long long ll; int main() { int n,m,a[110],b[110]={0}; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) scanf("%d",&a[i]); queue<int>ff; for(int i=1;i<=n;i++) { ff.push(i); } int en=1; while(!ff.empty()) { int w=ff.front(); b[w]+=m; if(b[w]>=a[w]) { en=w; ff.pop(); } else { ff.push(w); ff.pop(); } } cout<<en<<endl; return 0; }
相关文章推荐
- codeforces-DIV2-A-Jzzhu and Children
- Jzzhu and Children - CF 450A 水题
- CodeForces 450-A. Jzzhu and Children
- 450A - Jzzhu and Children 找规律也能够模拟
- Codeforces Round #257 (Div. 2) 450A - Jzzhu and Children(模拟)
- 450A - Jzzhu and Children 找规律也可以模拟
- 【矩阵快速幂 】Codeforces 450B - Jzzhu and Sequences (公式转化)
- CodeForces 450D - Jzzhu and Cities (dij + heap )
- Codeforces Div. 2 #257-C. Jzzhu and Chocolate
- 【codeforces 449C】Jzzhu and Apples
- cf #257(Div.2) A. Jzzhu and Children
- A. Jzzhu and Children
- Jzzhu and Cities(CodeForces - 449B)
- Codeforces 449 B. Jzzhu and Cities
- Codeforces 449 B. Jzzhu and Cities(图论dijk)
- codeforces 449C C. Jzzhu and Apples(数论+构造)
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children(简单题)
- Jzzhu and Children
- codeforces 450B B. Jzzhu and Sequences(矩阵快速幂)
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children