标签：sts rate pac span imu blog ber 数学 core
题意：
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.
The first line contains three space-separated integers k, a and b (1?≤?k?≤?1e9, 0?≤?a,?b?≤?1e9, a?+?b?>?0).
If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets.
11 11 5
1
11 2 3
-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 }
标签：sts rate pac span imu blog ber 数学 core
原文地址：http://www.cnblogs.com/wangyiming/p/6399358.html
