Table Tennis Game 2

Description

Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly k points, the score is reset and a new set begins.

Across all the sets Misha scored a points in total, and Vanya scored b points. Given this information, determine the maximum number of sets they could have played, or that the situation is impossible.

Note that the game consisted of several complete sets.

Input

The first line contains three space-separated integers k, a and b (1 ≤ k ≤ 10⁹, 0 ≤ a, b ≤ 10⁹, a + b > 0).

Output

If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets.

Sample Input

 题解：每一轮系列赛若要完成胜出的一方需要达到k分。此题分为两种情况：(1)a<k&&b<k;(2)c=max(a,b),c%k!=0&&min(a,b)<k输出-1，其他情况输出a/k+b/k;

(Input

11 11 5

Output

1

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
using namespace std;
int main()
{
    int i,j,n,ans=0,t,k,ans1=0,m,b,a;
    scanf("%d%d%d",&a,&b,&n);
    m=n>b?n:b;
    k=n>b?b:n;
    ans=m/a;
    ans1=k/a;
    if((ans==0&&ans1==0))
        printf("-1
");
    else
    {

            if(m%a!=0&&k<a)
                printf("-1
");
            else
               printf("%d
",ans+ans1);
    }
        return 0;
}