Irrationa problem

A- Irrational problem _p

Time Limit: 2000MS

Memory Limit: 262144K

64bit IO Format: %I64d& %I64

Description

Little Petya was given this problem for homework:

You are given function  (here  represents the operationof taking the remainder). His task is to count the number ofintegers x inrange [a;b] withproperty f(x) = x.

It is a pity that Petya forgot the order in which the remaindersshould be taken and wrote down only 4 numbers. Each of 24 possibleorders of taking the remainder has equal probability of beingchosen. For example, if Petya has numbers 1, 2, 3, 4 then he cantake remainders in that order or first take remainder modulo 4,then modulo 2, 3, 1. There also are 22 other permutations of thesenumbers that represent orders in which remainder can be taken. Inthis problem 4 numbers wrote down by Petya will be pairwisedistinct.

Now it is impossible for Petya to complete the task given byteacher but just for fun he decided to find the number ofintegers  with property thatprobability thatf(x) = x isnot less than 31.4159265352718281828459045%. In otherwords, Petya will pick up the number x if there existat least 7 permutations ofnumbersp₁, p₂, p₃, p₄, forwhich f(x) = x.

Input

First line of the input will contain 6 integers, separated byspaces: p₁, p₂, p₃, p₄, a, b (1 ≤ p₁, p₂, p₃, p₄ ≤ 1000, 0 ≤ a ≤ b ≤ 31415).

It is guaranteed that numbers p₁, p₂, p₃, p₄ will be pairwisedistinct.

Output

Output the number of integers in the given range that have thegiven property.

Sample Input

Input

2 7 1 8 2 8

Output

0

Input

20 30 40 50 0 100

Output

20

Input

31 41 59 26 17 43

Output

9

[Submit]  [GoBack]   [Status]

#include<iostream>
using namespace std;
int main()
{
     int a,b,p1,p2,p3,p4,count;
         while(cin>>p1>>p2>>p3>>p4>>a>>b)
         {
                 count=0;
                 for(int i=a;i<=b;i++)
                         if((((i%p1)%p2)%p3)%p4==i)
                               count++;

                         cout<<count<<endl;
         }
  return 0;
                

}

---