Codeforces Round #433 Div. 2 B. Maxim Buys an Apartment
来源:互联网 发布:如何预防网络电信诈骗 编辑:程序博客网 时间:2024/05/16 23:43
Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and are arranged in a row. Two apartments are adjacent if their indices differ by 1. Some of the apartments can already be inhabited, others are available for sale.
Maxim often visits his neighbors, so apartment is good for him if it is available for sale and there is at least one already inhabited apartment adjacent to it. Maxim knows that there are exactly k already inhabited apartments, but he doesn't know their indices yet.
Find out what could be the minimum possible and the maximum possible number of apartments that are good for Maxim.
The only line of the input contains two integers: n and k (1 ≤ n ≤ 109, 0 ≤ k ≤ n).
Print the minimum possible and the maximum possible number of apartments good for Maxim.
6 3
1 3
In the sample test, the number of good apartments could be minimum possible if, for example, apartments with indices 1, 2 and 3 were inhabited. In this case only apartment 4 is good. The maximum possible number could be, for example, if apartments with indices 1, 3and 5 were inhabited. In this case all other apartments: 2, 4 and 6 are good.
题意:n间一排的房子,其中k个房子有人,你是个特别的人,一定要房子边有人,问你最少和最多有多少间房子符合你的要求
分类讨论一下
#include<iostream>#include<cstdio>typedef long long ll;using namespace std;int gcd(int a,int b){return b==0?a:gcd(b,a%b);}int main(){ ll i,j,k,n; scanf("%lld%lld",&n,&k); if(n==k||k==0){ printf("0 0\n"); return 0; } if(n<=3*k){ printf("1 %lld\n",n-k); return 0; } printf("1 %lld",2*k); return 0;}
- Codeforces Round #433 Div. 2 B Maxim Buys an Apartment
- Codeforces Round #433 (Div. 2)B. Maxim Buys an Apartment
- Codeforces Round #433 (Div. 2) B. Maxim Buys an Apartment
- Codeforces Round #433 Div. 2 B. Maxim Buys an Apartment
- Codeforces Round #433 (2)B :Maxim Buys an Apartment
- Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) B. Maxim Buys an Apartment
- Codeforces Round #433 (Div. 2) B.Maxim Buys an Apartment(找规律+技巧)
- Codeforces Round #433 (Div.2 ) B. Maxim Buys an Apartment(水题)
- Codeforces Round #433 B.Maxim Buys an Apartment
- Codeforces Round#433 B. Maxim Buys an Apartment
- Codeforces 854 B Maxim Buys an Apartment
- Codeforces 845 B. Maxim Buys an Apartment
- Codeforces 854B Maxim Buys an Apartment
- B. Maxim Buys an Apartment
- Codeforces 854B. Maxim Buys an Apartment 水题
- CF #433 DIV2 B. Maxim Buys an Apartment
- CF854B Maxim Buys an Apartment【思路】
- Codeforces Round #374 (Div. 2) D - Maxim and Array
- CentOS7 单独分区var空间不足问题
- ListView异步加载图片,完美实现图文混排
- Linux指令学习之crontab 定时执行任务
- SpringCloud(第 005 篇)电影微服务,也注册到 EurekaServer 中,通过 Http 协议访问已注册到生态圈中的用户微服务
- 网卡TSO、UFO、GSO、LRO、GRO和RSS介绍
- Codeforces Round #433 Div. 2 B. Maxim Buys an Apartment
- 【知了堂学习笔记】简单了解java集合类
- AngularJs的点击删除,排序,查询
- Apache ActiveMQ 各个版本所依赖的JDK版本
- 二叉树的存储结构
- 图像形态学运算之腐蚀-膨胀篇
- mysql使用存储过程批量生成学生表、课程表和成绩表测试数据
- 关于Unicode编码和ANSI编码(2)
- ubuntu下lua插件使用方式