CodeForecs 476A【greedy】

A. Dreamoon and Stairs
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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?

Input
The single line contains two space separated integers n, m (0 < n ≤ 10000, 1 < m ≤ 10).

Output
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  - 1 instead.

Examples
inputCopy
10 2
output
6
inputCopy
3 5
output
-1
Note
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.

思路：一次可以上1个或者两个台阶。问上到n台阶的最小步数，同时步数应该满足是m的倍数。
贪心思想，为了达到最少步数，都两个两个的上，如果不满足倍数关系，再将一个两步分为两个一步，直至满足倍数关系。

#include<iostream>
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    int step = (n+1)/2;
    while(step<=n)
    {
        if(step%m==0)
        {
            cout<<step<<endl;
            break;
        }
        else step++;
    }
    if(step>n) cout<<-1<<endl;
    return 0;
}