CF765C Table Tennis Game 2

Posted 王宜鸣

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了CF765C Table Tennis Game 2相关的知识,希望对你有一定的参考价值。

题意:

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 ka and b (1?≤?k?≤?1e9, 0?≤?a,?b?≤?1e9, a?+?b?>?0).

Output

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

Examples
input
11 11 5
output
1
input
11 2 3
output
-1

思路:

数学题。

实现:

 1 #include <iostream>
 2 #include <cstdio>
 3 using namespace std;
 4 
 5 int k, a, b;
 6 int main()
 7 {
 8     cin >> k >> a >> b;
 9     if (a < k && b % k || b < k && a % k)
10         puts("-1");
11     else
12         cout << a / k + b / k << endl;
13     return 0;
14 }

 

以上是关于CF765C Table Tennis Game 2的主要内容,如果未能解决你的问题,请参考以下文章

Tennis Game CodeForces - 496D(唯一分解定理,费马大定理)

PAT 1026 Table Tennis

PAT 1026. Table Tennis

@@443 B. Table Tennis

1026 Table Tennis (30 分)

1795. Table tennis