A. Vasya the Hipster

题目链接：http://codeforces.com/problemset/problem/581/A

581A. 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.

样例
Examples
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,b两种数量的袜子，问两只脚穿不同的袜子的最多天数，以及后面穿相同袜子的天数。

思路：找出a,b最小值，最小的值即为穿不同袜子的最多天数。最大的值减最小的值再除以2即为后面穿相同袜子的天数。

代码

#include<stdio.h>
int main()
{int a,b;scanf("%d%d",&a,&b);if(a>b){printf("%d %d\n",b,(a-b)/2);}else {printf("%d %d\n",a,(b-a)/2);}return 0;
}

A. Vasya the Hipster相关推荐

【Codeforces】A2组刷题记录（50 / 50）完结
目录 A1. Counterexample A2. Good Number A3. Dice Tower ★A4. Alyona and Numbers A5. Mountain Scenery rz ...
Codewars Vasya - Clerk--6 kyu--Python解法
Codewars Vasya - Clerk–6 kyu–Python解法 Codewars 是一个跟LeetCode类似的结题网站. Codewars题解专栏:Codewars题解题目地址:Tra ...
Codeforces Round #281 (Div. 2) C. Vasya and Basketball 二分
C. Vasya and Basketball 题目连接: http://codeforces.com/contest/493/problem/C Description Vasya follows ...
Vasya and String CodeForces - 676C（尺取法）
High school student Vasya got a string of length n as a birthday present. This string consists of le ...
CodeForces - 1058D D. Vasya and Triangle
D. Vasya and Triangle time limit per test1 second memory limit per test256 megabytes inputstandard i ...
CodeForces 1058C C. Vasya and Golden Ticket
C. Vasya and Golden Ticket time limit per test1 second memory limit per test256 megabytes inputstand ...
java hipster!_通过Java Hipster升级Spring Security OAuth和JUnit测试
java hipster! "我喜欢编写身份验证和授权代码." 〜从来没有Java开发人员. 厌倦了一次又一次地建立相同的登录屏幕? 尝试使用Okta API进行托管身份验证,授权 ...
【CodeForces - 1051C 】Vasya and Multisets （模拟）
题干: Vasya has a multiset ss consisting of nn integer numbers. Vasya calls some number xxnice if it a ...
【CodeForces - 1051A】Vasya And Password （构造，水题）
题干: Vasya came up with a password to register for EatForces - a string ss. The password in EatForces ...
CF Edu54 E. Vasya and a Tree DFS+树状数组
Vasya and a Tree 题意: 给定一棵树,对树有3e5的操作,每次操作为,把树上某个节点的不超过d的子节点都加上值x; 思路: 多开一个vector记录每个点上的操作.dfs这颗树,同时以 ...

A. Vasya the Hipster

581A. Vasya the Hipster

A. Vasya the Hipster相关推荐

最新文章

热门文章