Codeforces Round #272 (Div. 2)-A. Dreamoon and Stairs
http://codeforces.com/contest/476/problem/A
1 second
256 megabytes
standard input
standard output
Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.
What is the minimal number of moves making him climb to the top of the stairs that satisfies his condition?
The single line contains two space separated integers n, m (0 < n ≤ 10000, 1 < m ≤ 10).
Print a single integer — the minimal number of moves being a multiple of m. If there is no way he can climb satisfying condition print - 1instead.
10 2
6
3 5
-1
For the first sample, Dreamoon could climb in 6 moves with following sequence of steps: {2, 2, 2, 2, 1, 1}.
For the second sample, there are only three valid sequence of steps {2, 1}, {1, 2}, {1, 1, 1} with 2, 2, and 3 steps respectively. All these numbers are not multiples of 5.
解题思路:一个N阶的楼梯,每次能走1,或者2阶,求最小的爬完楼梯的次数,且要满足次数是m的倍数
贪心,枚举最少走2阶且满足条件的次数
1 #include <stdio.h>
2
3 int main(){
4 int x, y, n, m, min;
5 while(scanf("%d %d", &n, &m) != EOF){
6 min = ;
7 for(y = ; y <= n / ; y++){
8 x = n - * y;
9 if((x + y) % m == ){
if((x + y) < min){
min = x + y;
}
}
}
if(min != ){
printf("%d\n", min);
}
else{
printf("-1\n");
}
}
return ;
23 }
最新文章
- mysql 如何用一条SQL将一张表里的数据插入到另一张表 3个例子
- ros使用rplidar hector_mapping建地图
- Nginx 日志文件切割
- TreeView控件
- unix的策略与机制
- 对加密方式(公钥私钥)的形象理解(以http和https为例)
- 通过 ANE(Adobe Native Extension) 启动Andriod服务 推送消息(一)
- 在自定义的web监听器中嵌入web中的定时事件
- winform 曲线(贝塞尔) 分类: WinForm 2014-12-29 16:52 109人阅读 评论(0) 收藏
- CentOS7配置php7.0支持redis
- maven配置及IDEA配置maven环境
- BOS判断字段为空
- unittest模块小结
- skynet记录7:服务(c和lua)
- 牛客练习赛13D 幸运数字4
- Java多线程-----理解CountDownLatch
- Linux安装Nginx报错: ./configure: error: C compiler cc is not found
- MySQL管理实务处理
- Math.floor,Math.ceil,Math.rint,Math.round用法
- 分布式文件系统 ~MogileFS~