Codeforces Round #257 (Div. 2) A. Jzzhu and Children
2014-07-20 07:51
477 查看
A. Jzzhu and Children
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
题目大意 :给每个小孩发糖 每个小孩需要一定数量的糖a【i】才会离开 小孩开始排成一队 每次都发一定数量的糖m 没发满糖的小孩拍到队尾去 求最后离开的小孩是第几号
就是看哪个小孩能被发糖多少次 输出最多次数的那个 如果次数相同 则输出位置靠后的。。。。
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
题目大意 :给每个小孩发糖 每个小孩需要一定数量的糖a【i】才会离开 小孩开始排成一队 每次都发一定数量的糖m 没发满糖的小孩拍到队尾去 求最后离开的小孩是第几号
就是看哪个小孩能被发糖多少次 输出最多次数的那个 如果次数相同 则输出位置靠后的。。。。
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main() { int n,m,i,a[105]; while(cin>>n>>m) { for(i=1;i<=n;i++) cin>>a[i]; for(i=1;i<=n;i++) { a[i]=(a[i]-1)/m; } int maxn=a[1]; int k=1; for(i=2;i<=n;i++) if(maxn<=a[i]) { maxn=a[i]; k=i; } cout<<k<<endl; } return 0; }
相关文章推荐
- codeforces-DIV2-A-Jzzhu and Children
- Codeforces Div. 2 #257-A. Jzzhu and Children
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- Codeforces Round #257 (Div. 2/A)/Codeforces450A_Jzzhu and Children
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children(简单题)
- Codeforces Round #257 (Div. 2/A)/Codeforces450A_Jzzhu and Children
- Codeforces Round #257 (Div. 2)1A Jzzhu and Children
- Codeforces #257 div 2 A. Jzzhu and Children
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- Codeforces Round #257 (Div. 2) 450A - Jzzhu and Children(模拟)
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- Codeforces Round #257 (Div. 2)A. Jzzhu and Children
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children(简单题)
- Jzzhu and Children
- Codeforces Round #257 (Div. 2) B. Jzzhu and Sequences
- Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2)C. Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate