714A. Meeting of Old Friends

A. Meeting of Old Friends
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!

Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she prinks and is unavailable for Filya.

Filya works a lot and he plans to visit Sonya from minute l2 to minute r2 inclusive.

Calculate the number of minutes they will be able to spend together.

Input

The only line of the input contains integers l1, r1, l2, r2 and k (1 ≤ l1, r1, l2, r2, k ≤ 1018, l1 ≤ r1, l2 ≤ r2), providing the segments of time for Sonya and Filya and the moment of time when Sonya prinks.

Output

Print one integer — the number of minutes Sonya and Filya will be able to spend together.

Examples
Input
1 10 9 20 1
Output
2
Input
1 100 50 200 75
Output
50
Note

In the first sample, they will be together during minutes 9 and 10.

In the second sample, they will be together from minute 50 to minute 74 and from minute 76 to minute 100.


题意分析:Sonya的醒着的时间是从 l1 到 r1,Filya计划在时间 l2 到 r2 之间去看Sonya,并且在时间 k 的时候,Sonya 无法和Filya见面。问两人见面的时间。

#include <stdio.h>

int main()  
{  
      long long a,b,c,d,k;
      scanf("%I64d%I64d%I64d%I64d%I64d",&a,&b,&c,&d,&k);
      long long min,max;
      
      min = a<c?c:a;
      max = b<d?b:d;
      
      if(min>max){
             printf("0");
              return 0;
      }
      if(k>=min&&k<=max)
              k=1;
       else
              k=0;
       printf("%I64d",max-min-k+1);
        
       return 0;  
}  



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值