A. Vasya the Hipster
2015-09-30 19:35
253 查看
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and bblue
socks.
According to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.
Every day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.
Vasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.
Can you help him?
Input
The single line of the input contains two positive integers a and b (1 ≤ a, b ≤ 100)
— the number of red and blue socks that Vasya's got.
Output
Print two space-separated integers — the maximum number of days when Vasya can wear different socks and the number of days when he can wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.
Keep in mind that at the end of the day Vasya throws away the socks that he's been wearing on that day.
Sample test(s)
input
output
input
output
input
output
Note
In the first sample Vasya can first put on one pair of different socks, after that he has two red socks left to wear on the second day.
解题说明:一道水题,根据袜子数目计算即可。
#include<stdio.h>
#include <string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
scanf("%d%d",&n,&m);
if(n<=m)
{
printf("%d %d\n",n,(m-n)/2);
}
else
{
printf("%d %d\n",m,(n-m)/2);
}
return 0;
}
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and bblue
socks.
According to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.
Every day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.
Vasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.
Can you help him?
Input
The single line of the input contains two positive integers a and b (1 ≤ a, b ≤ 100)
— the number of red and blue socks that Vasya's got.
Output
Print two space-separated integers — the maximum number of days when Vasya can wear different socks and the number of days when he can wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.
Keep in mind that at the end of the day Vasya throws away the socks that he's been wearing on that day.
Sample test(s)
input
3 1
output
1 1
input
2 3
output
2 0
input
7 3
output
3 2
Note
In the first sample Vasya can first put on one pair of different socks, after that he has two red socks left to wear on the second day.
解题说明:一道水题,根据袜子数目计算即可。
#include<stdio.h>
#include <string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
scanf("%d%d",&n,&m);
if(n<=m)
{
printf("%d %d\n",n,(m-n)/2);
}
else
{
printf("%d %d\n",m,(n-m)/2);
}
return 0;
}
相关文章推荐
- 剑指offer—重建二叉树
- Java基础知识强化之IO流笔记12:递归之递归解决问题的思想(图解)
- 第三次作业-结对编程
- java成果汇报
- hdu-5489(2015网络赛合肥赛区)***
- C语言之回调函数
- poj3468(区间更新->记录增量)
- 正则awk和查看文件行数
- 实验一.1
- CentOS 6.3下部署LVS(NAT)+keepalived实现高性能高可用负载均衡
- POJ 2182&& POJ 2828:Lost Cows 从后往前 线段树
- POJ 2182&& POJ 2828:Lost Cows 从后往前 线段树
- 【Foundation-62-1】#import <Foundation/NSRange.h>范围
- 海思Hi3518平台mount /mnt/mtd/失败并目录都被删除
- 第三次作业——计划书导入软件的实现
- 写让别人能读懂的代码
- C++模板 静态成员 定义(实例化)
- HDU 1799 排列组合
- 剑指offer—从头到尾打印链表
- android 中如何分析内存泄漏