Codeforce 1255 Round #601 (Div. 2) A. Changing Volume （贪心）

Bob watches TV every day. He always sets the volume of his TV to bb. However, today he is angry to find out someone has changed the volume to aa. Of course, Bob has a remote control that can change the volume.

There are six buttons (−5,−2,−1,+1,+2,+5−5,−2,−1,+1,+2,+5) on the control, which in one press can either increase or decrease the current volume by 11, 22, or 55. The volume can be arbitrarily large, but can never be negative. In other words, Bob cannot press the button if it causes the volume to be lower than 00.

As Bob is so angry, he wants to change the volume to bb using as few button presses as possible. However, he forgets how to do such simple calculations, so he asks you for help. Write a program that given aa and bb, finds the minimum number of presses to change the TV volume from aa to bb.

Input

Each test contains multiple test cases. The first line contains the number of test cases TT (1≤T≤10001≤T≤1000). Then the descriptions of the test cases follow.

Each test case consists of one line containing two integers aa and bb (0≤a,b≤1090≤a,b≤109) — the current volume and Bob's desired volume, respectively.

Output

For each test case, output a single integer — the minimum number of presses to change the TV volume from aa to bb. If Bob does not need to change the volume (i.e. a=ba=b), then print 00.

Example

Input

Output

2
3
2

Note

In the first example, Bob can press the −2−2 button twice to reach 00. Note that Bob can not press −5−5 when the volume is 44 since it will make the volume negative.

In the second example, one of the optimal ways for Bob is to press the +5+5 twice, then press −1−1 once.

In the last example, Bob can press the +5+5 once, then press +1+1.

能选5的时候选5，不能选5的时候选2，不能选2的时候选1。

验证可行性，如果有个大于等于5的数，不选5那么至少要选两个2一个1，甚至更多，所以直接贪心，完事。

#include<bits/stdc++.h>
#define MAXM 100000000
#define MAXN 1000005
using namespace std;
int main()
{int a,b,t;cin>>t;while(t--){cin>>a>>b;int ans=abs(a-b);int c=ans%5;int sum=(ans-c)/5;ans=c%2;sum+=(c-ans)/2+ans;cout<<sum<<endl;}
}

Codeforce 1255 Round #601 (Div. 2) A. Changing Volume （贪心）相关推荐

Codeforce 1255 Round #601 (Div. 2) C. League of Leesins （大模拟）
Bob is an avid fan of the video game "League of Leesins", and today he celebrates as the L ...
Codeforces Round #601 (Div. 2) E2. Send Boxes to Alice (Hard Version) 思维 + 质因子
传送门文章目录题意: 思路: 题意: 大体题意跟easyeasyeasy版本差不多,就是hardhardhard版本的aaa范围更大.见这里Codeforces Round #601 (Div. ...
Codeforces Round #601 (Div. 2)
传送门文章目录 A.Changing Volume 题意: 思路: B. Fridge Lockers 题意: 思路: C. League of Leesins 题意: 思路: D. Feeding ...
Codeforces Round #433(Div. 2) D. Jury Meeting(贪心)
题目链接:Codeforces Round #433(Div. 2) D. Jury Meeting 题意: 有n个城市,每个城市有一个人,现在要让这些人来0号城市在一起k天,然后回去. 现在有m个日 ...
Codeforces Round #656 (Div. 3) F. Removing Leaves 贪心 + 模拟
传送门文章目录题意: 思路: 题意: 思路: 首先有一个贪心策略就是每次都找一个叶子节点最多的点,让后删掉他的kkk个叶子节点,现在我们就来考虑如何模拟这个过程. 我们整一个vector<s ...
Codeforces Round #601 (Div. 2)D. Feeding Chicken，二维压一维，几何平面的分配
D. Feeding Chicken 题目大意:就是给你一个r∗cr*cr∗c的矩阵,矩阵上若干个位置上有食物,你有k只小鸡,你要将这r∗cr*cr∗c的矩阵分成k个联通块给每个小鸡,使得有最大食物的 ...
Codeforces Round #601 (Div. 2)B. Fridge Lockers
B. Fridge Lockers [题目类型]模拟 [题目链接]B题链接 [题目大意]给你n个冰箱,m个铁链对这n个冰箱连接,要求使用所有的铁链对冰箱进行连接,满足非冰箱主人不能独自打开,u冰箱连接 ...
Codeforces Beta Round #52 (Div. 2) D. Changing a String DP输出方案
https://codeforces.com/contest/56/problem/D 就是编辑距离的加强版,需要输出方案,那么状态转移方程应该比较常规了,设 d p [ i ] [ j ] dp[i ...
Codeforces Round #180 (Div. 2) A. Snow Footprints 贪心
A. Snow Footprints 题目连接: http://www.codeforces.com/contest/298/problem/A Description There is a stra ...

Codeforce 1255 Round #601 (Div. 2) A. Changing Volume （贪心）

Codeforce 1255 Round #601 (Div. 2) A. Changing Volume （贪心）相关推荐

最新文章

热门文章