Codeforces Round #257 (Div. 2) 450A - Jzzhu and Children(模拟)
来源:互联网 发布:修改手机游戏数据 编辑:程序博客网 时间:2024/06/05 17:58
AC代码:
#include <stdio.h>int main(){ int n,m,i,a,max,k,c; while(~scanf("%d%d",&n,&m)){ k=0; for(i=0;i<n;i++){ scanf("%d",&c); if(c%m) a=c/m+1; else a=c/m; if(i==0){ max=a; k=i+1; } else{ if(max<=a) { max=a; k=i+1; } } } printf("%d\n",k); } return 0;}
0 0
- Codeforces Round #257 (Div. 2) 450A - Jzzhu and Children(模拟)
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children
- Codeforces Round #257 (Div. 2)1A 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
- Codeforces Round #257 (Div. 2) Jzzhu and Children (队列)
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children(简单题)
- Codeforces Round #257 (Div. 2) A. Jzzhu and Children解题报告
- Codeforces Div. 2 #257-A. Jzzhu and Children
- Codeforces #257 div 2 A. Jzzhu and Children
- Codeforces Round #257 (Div. 2)449A - Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2/A)/Codeforces450A_Jzzhu and Children
- Codeforces 450A Jzzhu and Children
- CodeForces 450-A. Jzzhu and Children
- Codeforces 450A Jzzhu and Children(水题)
- codeforces 450A Jzzhu and Children
- [学习笔记]Java基础_IO(包含对象流序列化使用和RandomAccessFile 类的使用)
- iOS开发笔记之一——Xcode 5.0 EXC_BAD_ACCESS 解决方案之一
- 填充dgv控件的行和列
- bootstrap之UpdateStrings
- 常量、变量 与 静态区、栈区、堆区的关系
- Codeforces Round #257 (Div. 2) 450A - Jzzhu and Children(模拟)
- 【UI 设计】PhotoShop基础工具 -- 移动工具
- 视频重定向设置
- CF找规律
- 重要网站的链接
- POJ 2075 Tangled in Cables(最小生成树)
- ubuntu中ANT的安装和配置
- 欧拉定理
- dwwwwwwwd