水
2015-09-28 20:17
357 查看
读了二十分钟题,做了五分钟。。。。
A. Vasya the Hipster
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
A. Vasya the Hipster
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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<stdio.h> int main() { int a,b,A=0,B=0; scanf("%d%d",&a,&b); while(a!=0&&b!=0) { a--;b--; A++; } if(a==0) while(1) { if(b>=2) { b=b-2;B++; } else break; } if(b==0) while(1) { if(a>=2) { a=a-2;B++; } else break; } printf("%d %d",A,B); return 0; }
相关文章推荐
- Lua和C语言的交互详解
- 关于C语言中参数的传值问题
- 简要对比C语言中三个用于退出进程的函数
- 深入C++中API的问题详解
- 基于C语言string函数的详解
- C语言中fchdir()函数和rewinddir()函数的使用详解
- C语言内存对齐实例详解
- 使用C语言判断英文字符大小写的方法
- c语言实现的带通配符匹配算法
- C语言实现顺序表基本操作汇总
- C语言中计算正弦的相关函数总结
- 使用C语言详解霍夫曼树数据结构
- 探讨C语言的那些小秘密之断言
- C语言实现BMP转换JPG的方法
- 深入探讨C语言中局部变量与全局变量在内存中的存放位置
- C语言查找数组里数字重复次数的方法
- C语言泛型编程实例教程
- C语言中使用lex统计文本文件字符数
- 在C语言中转换时间的基本方法介绍
- C语言进制转换代码分享