Caisa去商店买Sugar 商店找零的最低单位为元 低于1元的部分每分找一个糖果 商店有n种Suger Caisa有s元钱 她只买一种Sugar 输入n s 再输入n行 每行两个数a b 表示第i种Sugar的单价为a元b分 求Sugar最多能被找多少糖果
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int n, s, cos;
while (~scanf ("%d%d", &n, &s))
{
s *= 100;
int flag = 0, a, b, ans = 0;
while (n--)
{
scanf ("%d%d", &a, &b);
cos = a * 100 + b;
for (int j = 1; cos * j <= s; ++j)
{
flag = 1;
ans = max (ans, (s - cos) % 100);
}
}
printf ("%d\n", flag ? ans : -1);
}
return 0;
}
Caisa is going to have a party and he needs to buy the ingredients for a big chocolate cake. For that he is going to the biggest supermarket in town.
Unfortunately, he has just s dollars for sugar. But that‘s not a reason to be sad, because there are n types of sugar in the supermarket, maybe he able to buy one. But that‘s not all. The supermarket has very unusual exchange politics: instead of cents the sellers give sweets to a buyer as a change. Of course, the number of given sweets always doesn‘t exceed 99, because each seller maximizes the number of dollars in the change (100 cents can be replaced with a dollar).
Caisa wants to buy only one type of sugar, also he wants to maximize the number of sweets in the change. What is the maximum number of sweets he can get? Note, that Caisa doesn‘t want to minimize the cost of the sugar, he only wants to get maximum number of sweets as change.
The first line contains two space-separated integers n,?s (1?≤?n,?s?≤?100).
The i-th of the next n lines contains two integers xi, yi (1?≤?xi?≤?100; 0?≤?yi?<?100), where xi represents the number of dollars and yi the number of cents needed in order to buy the i-th type of sugar.
Print a single integer representing the maximum number of sweets he can buy, or -1 if he can‘t buy any type of sugar.
5 10 3 90 12 0 9 70 5 50 7 0
50
5 5 10 10 20 20 30 30 40 40 50 50
-1
In the first test sample Caisa can buy the fourth type of sugar, in such a case he will take 50 sweets as a change.
Codeforce 264 A Caisa and Sugar(简单)
原文地址：http://blog.csdn.net/acvay/article/details/38946011
