Jzzhu and Children - CF 450A 水题
来源:互联网 发布:ubuntu 14.04 snmp 编辑:程序博客网 时间:2024/05/16 11:04
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?
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 a single integer, representing the number of the last child.
5 21 3 1 4 2
4
6 41 1 2 2 3 3
6
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代码如下:
#include<cstdio>#include<cstring>#include<queue>using namespace std;struct node{ int num,candy;};queue<node> qu;int main(){ int n,m,i,j,k,num,candy; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) { scanf("%d",&k); node c; c.num=i; c.candy=k; qu.push(c); } while(!qu.empty()) { num=qu.front().num; candy=qu.front().candy; qu.pop(); candy-=m; if(candy>0) { node c; c.num=num; c.candy=candy; qu.push(c); } } printf("%d\n",num);}
- Jzzhu and Children - CF 450A 水题
- 【CF 450A】 Jzzhu and Children
- (CF#257)A. Jzzhu and Children
- Codeforces 450A Jzzhu and Children(水题)
- A. Jzzhu and Children
- A. Jzzhu and Children
- cf #257(Div.2) A. Jzzhu and Children
- Codeforces 450A Jzzhu and Children
- CodeForces 450-A. Jzzhu and Children
- codeforces 450A Jzzhu and Children
- 450A - Jzzhu and Children 找规律也可以模拟
- codeforces-DIV2-A-Jzzhu and Children
- A. Jzzhu and Children (周赛4)
- CF Problem 449A Jzzhu and Chocolate
- Jzzhu and Children
- Jzzhu and Children
- Codeforces Round #257 (Div. 2) 450A - Jzzhu and Children(模拟)
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- hdu2089(数位dp入门题)
- Jzzhu and Sequences - CF 450B 矩阵快速幂版
- c++构造函数详解(转)
- [转]vc6.0 MSDN下载地址
- poj 1185
- Jzzhu and Children - CF 450A 水题
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children(简单题)
- 如何找到券商实习
- +方法是一个类方法 sitanfu 白老头的解释 意思是将它发送给类,而不是对象实例....
- python中的extend和append的区别
- ArrayList的练习 编写程序实现对Employee类的排序
- 详解 coredump
- USACO 2.3.3 Zero Sum
- Python的lambda匿名函数