মেজবার টেক ডায়েরি

                                                                          B. Vanya and Lanterns time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vanya walks late at night along a straight street of length  l , lit by  n  lanterns. Consider the coordinate system with the beginning of the street corresponding to the point  0 , and its end corresponding to the point  l . Then the  i -th lantern is at the point  a i . The lantern lights all points of the street that are at the distance of at most  d  from it, where  d  is some positive number, common for all lanterns. Vanya wonders: what is the minimum light radius  d  should the lanterns have to light the whole street? Input The first ...

A. Candies and Two Sisters time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are two sisters Alice and Betty. You have  n n  candies. You want to distribute these  n n  candies between two sisters in such a way that: Alice will get  a a  ( a > 0 a > 0 ) candies; Betty will get  b b  ( b > 0 b > 0 ) candies; each sister will get some  integer  number of candies; Alice will get a greater amount of candies than Betty (i.e.  a > b a > b ); all the candies will be given to one of two sisters (i.e.  a + b = n a + b = n ). Your task is to calculate the number of ways to distribute exactly  n n  candies between sisters in a way described above. Candies are indistinguishable. Formally, find the number of ways to represent  n n  as the sum of  n = a + b n = a + b , where  a a  and  b b  are positive integers and...