Dreamoon and Stairs上台阶
来源:互联网 发布:mac怎么设置屏幕 编辑:程序博客网 时间:2024/04/28 03:43
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 steps 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.
题目意思:http://codeforces.com/contest/476/problem/A
n阶台阶,每次只能走2阶或则1阶,问,最少的移动次数,满足m的倍数。否则,输出-1。
想法:贪心,最少台阶嘛,每次移动全部都是2,然后逐步把2变成2个1,直到满足是m的倍数,或则全部都是1。
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<vector>#include<queue>#include<map>#include<stack>#define rt return#define bk break#define ct continue#define sf scanf#define pf printf#define ms memset#define si(n) sf("%d",&n)#define pi(n) pf("%d\n",n)#define REP0(i,n) for(int i=0;i<(n);i++)#define REP1(i,n) for(int i=1;i<=(n);i++)#define REP(i,s,n) for(int i=s;i<=(n);i++)#define db double#define op operator#define pb push_back#define LL long long#define INF 0x3fffffff#define eps 1e-8#define PI acos(-1)#define maxn 1010using namespace std;int main(){ #ifdef ACBang// freopen("in.txt","r",stdin); #endif int n,m; while(~sf("%d%d",&n,&m)){ int cnt2=n/2; int cnt1=n%2; while((cnt2+cnt1)%m!=0&&cnt2!=0){ cnt2--; cnt1+=2; }// cout<<cnt1<<" "<<cnt2<<endl; if((cnt1+cnt2)%m!=0)puts("-1"); else pf("%d\n",cnt1+cnt2); } rt 0;}
- Dreamoon and Stairs上台阶
- A. Dreamoon and Stairs
- Dreamoon and Stairs
- 【CODEFORCES】 A. Dreamoon and Stairs
- A. Dreamoon and Stairs(Codeforces Round #272)
- Codeforces 476A. Dreamoon and Stairs
- codeforces-#476A. Dreamoon and Stairs
- Dreamoon and Stairs CodeForces - 476A
- Codeforces Round #272 (Div. 2) A Dreamoon and Stairs
- Codeforces Round #272 (Div. 2) A. Dreamoon and Stairs
- codeforces—— 476A —— Dreamoon and Stairs
- Climbing Stairs 递推上台阶
- Codeforces Round #272 (Div. 2) A Dreamoon and Stairs(水)
- Dreamoon and Sums 数学
- B. Dreamoon and WiFi
- Dreamoon and WiFi
- Dreamoon and WiFi
- Dreamoon and Sets_Codeforces
- 【Java.Spring.MVC】使用Spring MVC构建Web应用程序
- css样式布局中position的那些事儿
- linux下线程池的实现(c++)
- csdn博客排名终于进入2万名以内了~~
- 关于逃课
- Dreamoon and Stairs上台阶
- 第二章线性表思维导图
- C++中虚函数工作原理和(虚)继承类的内存占用大小计算
- Codeforces Round #272 (Div. 2) D
- 第一章学习总结
- 思维导图——数据结构
- PHP的静态成员以及self、$this和parent三者的区别
- Dreamoon and WiFi ???下同一位置的概率
- Ubuntu安装jdk