CF div2 322 A
2015-09-29 13:19
330 查看
A. Vasya the Hipster
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 b blue 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.
好水~~~~
View Code
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 b blue 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 <cstdio> #include <cstring> #include <iostream> #include <stack> #include <queue> #include <map> #include <algorithm> #include <vector> #include <cmath> using namespace std; const int maxn = 1000005; typedef long long LL; vector<int>G[maxn]; int a[maxn]; int res[maxn]; int main() { int n,m; int tmp = 0; int a,b; scanf("%d%d",&a,&b); printf("%d %d\n",min(a,b),abs(a-b)/2); return 0; }
View Code
相关文章推荐
- Linux命令之env:显示当前用户的环境变量
- hdu5491 The Next
- [LeetCode] Summary Ranges
- 多文件上传
- JAVA关于常量
- java的多态——null参数会调用哪个方法?
- 大数据学习笔记1
- 安装php的php-protobu扩展及使用 (二)
- 《pointers on c》的第1个例子
- java使用正则表达式方法和正则表达式大全
- 1 --SQLite 怎么关联起来
- nodejs 版本更新问题(v0.8.14 -> v4.1.1)
- Qt 5笔记
- ios获取设备信息总结
- JAVA修改、删除数据之后刷新JTable的方法
- JAVA中int、String的类型转换
- apache 虚拟主机
- Older Hobby
- Mybatis常用sql语句xml配置
- 文件上传