CF190A:Vasya and the Bus(易错题)

这篇博客介绍了Vasya遇到的一道易错题,涉及公交乘车费用问题。在High Bertown,一个成人支付1 Berland卢布,且最多可免费带一个孩子。如果超过一个孩子,成人需为每个额外的孩子支付1卢布。博客讨论了在不同成人和孩子数量下,乘客可能支付的最低和最高总费用,并给出了输入输出示例及代码解决方案,强调了特殊情况的处理和易错点。
摘要由CSDN通过智能技术生成
Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u

[]   [Go Back]   [Status]  

Description

One day Vasya heard a story: "In the city of High Bertown a bus number 62 left from the bus station. It hadn grown-ups andm kids..."

The latter events happen to be of no importance to us. Vasya is an accountant and he loves counting money. So he wondered what maximum and minimum sum of money these passengers could have paid for the ride.

The bus fare equals one berland ruble in High Bertown. However, not everything is that easy —no more than one child can ride for free with each grown-up passenger. That means that a grown-up passenger who rides with hisk (k > 0) children, pays overallk rubles: a ticket for himself and(k - 1) tickets for his children. Also, a grown-up can ride without children, in this case he only pays one ruble.

We know that in High Bertown children can't ride in a bus unaccompanied by grown-ups.

Help Vasya count the minimum and the maximum sum in Berland rubles, that all passengers of this bus could have paid in total.

Input

The input file consists of a single line containing two space-separated numbersn andm(0 ≤ n, m ≤ 105) — the number of the grown-ups and the number of the children in the bus, correspondingly.

Output

If n grown-ups and m children could have ridden in the bus, then print on a single line two space-separated integers — the minimum and the maximum possible total bus fare, correspondingly.

Otherwise, print "Impossible" (without the quotes).

Sample Input

Input
1 2
Output
2 2
Input
0 5
Output
Impossible
Input
2 2
Output
2 3

Sample Output

Hint

In the first sample a grown-up rides with two children and pays two rubles.

In the second sample there are only children in the bus, so the situation is impossible.

  • In the third sample there are two cases:
  • Each of the two grown-ups rides with one children and pays one ruble for the tickets. In this case the passengers pay two rubles in total.
  • One of the grown-ups ride with two children's and pays two rubles, the another one rides alone and pays one ruble for himself. So, they pay three rubles in total.

MYCode:

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m) != EOF)
    {
        if(n==0)
        {
            if(m!=0)
            printf("Impossible\n");
            else
            printf("0 0\n");
            continue;
        }
        int mini,most;
        if(n>=m)
        mini=n;
        else
        mini=n+(m-n);
        if(m>=1)
        most=n+m-1;
        else
        most=n;
        //most=n+m-1;
        printf("%d %d\n",mini,most);
    }
}

//

测试数据:
0 0

输出:0 0

40 0

输出:

40 40

注意考虑特殊情况,易错题目. 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值