# SGU276-Andrew's Troubles

8967人阅读 评论(0)

Famous Berland ACM-ICPC team Anisovka consists of three programmers: Andrew, Michael and Ilya. A long time ago, during the first few months the team was founded, Andrew was very often late to the trainings and contests. To stimulate Andrew to be more punctual, Ilya and Andrew decided to introduce a new rule for team participants. If somebody is late (i.e. comes at least one second after appointed time) he owes a cup of tea to other team members. If he is late for 5 minutes, he owes two cups of tea. If he is late for 15 minutes, he owes three cups of tea. And if he is late for 30 minutes or more, he owes 4 cups of tea.
The training starts at the time S (counted in seconds, from some predefined moment of time) and Andrew comes at the time P (also in seconds, counted from the same moment of time).
Your task is to find how many cups of tea Andrew owes.

Input
The input file contains single line with integer numbers S and P (0 <= S,P <= 10^4).

Output
Write to the output file the number of cups Andrew owes.

Sample test(s)

Input

Test #1 10 10 Test #2 10 11 Test #3 0 300
Output

Test #1
0

Test #2
1

Test #3
2

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
int main()
{
int m,n;
scanf("%d %d",&m,&n);
if(m==n)
printf("0\n");
if(n-m>=1800)
{
printf("4\n");
return 0;
}
if(n-m>=900)
{
printf("3\n");
return 0;
}
if(n-m>=300)
{
printf("2\n");
return 0;
}
if(n>m)
{
printf("1\n");
return 0;
}
return 0;
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：395717次
• 积分：6421
• 等级：
• 排名：第3761名
• 原创：240篇
• 转载：7篇
• 译文：0篇
• 评论：45条
文章分类